An application of the greedy heuristic of set cover to traffic checks
Year of publication: |
2008
|
---|---|
Authors: | Pusztai, Pál |
Published in: |
Central European Journal of Operations Research. - Springer. - Vol. 16.2008, 4, p. 407-414
|
Publisher: |
Springer |
Subject: | Set cover | Greedy heuristic | Traffic checks | Traffic assignment | Shortest paths |
-
On Nonredundant Cost-Constrained Team Formation
Huang, Jianbin, (2017)
-
Tight approximation bounds for combinatorial frugal coverage algorithms
Caragiannis, Ioannis, (2013)
-
Lee, Chieh-Hsiu Jason, (2015)
- More ...
-
Hungary's inflationary exposures to global price movements
Koppány, Krisztián, (2023)
-
An application of the greedy heuristic of set cover to traffic checks
Pusztai, Pál, (2008)
-
An application of the greedy heuristic of set cover to traffic checks
Pusztai, Pál, (2008)
- More ...