Improved Approximation Guarantees for Packing and Covering Integer Programs
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (2), 648-670
- https://doi.org/10.1137/s0097539796314240
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- The harmonic mean formula for probabilities of unions: applications to sparse random graphsDiscrete Mathematics, 1989
- Optima of dual integer linear programsCombinatorica, 1988
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- On the Greedy Heuristic for Continuous Covering and Packing ProblemsSIAM Journal on Algebraic Discrete Methods, 1982
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Correlation inequalities on some partially ordered setsCommunications in Mathematical Physics, 1971
- Coherent Structures of Non-Identical ComponentsTechnometrics, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952