Tight approximation results for general covering integer programs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 522-528

  Kolliopoulos, Stavros G ^a   Young, Neal E ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b AKAMAI TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; OPTIMIZATION;

COVERING INTEGER PROGRAMS (CIP);

INTEGER PROGRAMMING;

EID: 0035186341     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959928     Document Type: Article

References (22)

1. Strengthening integrality gaps for capacitated network design and covering problems
2. A measure of the asymptotic efficiency for tests of a hypothesis based on sum of observations
3. A greedy heuristic for the set-covering problem
4. Worst-case analysis of greedy heuristics for integer programming with non-negative data
5. On a combinatorial game
6. On the greedy heuristic for continuous covering and packing problems
7. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems
8. Approximation algorithms for combinatorial problems
9. On the ratio of optimal and fractional covers
10. Fast approximation algorithms for fractional packing and covering problems
11. Probabilistic construction of deterministic algorithms: Approximating packing integer programs
12. Randomized rounding: A technique for provably good algorithms and algorithmic proofs
13. Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
14. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
15. Approximation algorithms for facility location problems
16. An extension of the lovász local lemma and its applications to integer programming
17. Improved approximations guarantees for packing and covering integer programs
18. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
19. Randomized rounding without solving the linear program