Approximation algorithms for covering/packing integer programs
- 30 November 2005
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 71 (4), 495-505
- https://doi.org/10.1016/j.jcss.2005.05.002
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- An Extension of the Lovász Local Lemma, and its Applications to Integer ProgrammingSIAM Journal on Computing, 2006
- Approximating covering integer programs with multiplicity constraintsDiscrete Applied Mathematics, 2003
- Approximation AlgorithmsJournal of the Operational Research Society, 2002
- Improved Approximation Guarantees for Packing and Covering Integer ProgramsSIAM Journal on Computing, 1999
- Optimal File Sharing in Distributed NetworksSIAM Journal on Computing, 1995
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- On the Greedy Heuristic for Continuous Covering and Packing ProblemsSIAM Journal on Algebraic Discrete Methods, 1982
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973