A fast approximation algorithm for the multicovering problem
- 1 September 1986
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 15 (1) , 35-40
- https://doi.org/10.1016/0166-218x(86)90016-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981