Covering Problems with Hard Capacities
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 36 (2) , 498-515
- https://doi.org/10.1137/s0097539703422479
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- 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 Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Covering, Packing and Knapsack ProblemsAnnals of Discrete Mathematics, 1979
- Set Partitioning: A surveySIAM Review, 1976
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Note—A Computational Survey of Methods for the Set Covering ProblemManagement Science, 1975