An application of the greedy heuristic of set cover to traffic checks

DOI10.1007/s10100-008-0067-xzbMath1162.90384OpenAlexW2077705663MaRDI QIDQ1022400

Pál Pusztai

Publication date: 22 June 2009

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-008-0067-x

zbMATH Keywords

shortest pathstraffic assignmentset covergreedy heuristictraffic checks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (3)

Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ Empirical study of the greedy heuristic as applied to the link selection problem

Cites Work

• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A threshold of ln n for approximating set cover
• A Greedy Heuristic for the Set-Covering Problem
• On the hardness of approximating minimization problems

This page was built for publication: An application of the greedy heuristic of set cover to traffic checks