Improved approximation guarantees for packing and covering integer programs

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 648-670

  Srinivasan, Aravind ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; LINEAR PROGRAMMING; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; DETERMINISTIC POLYNOMIAL-TIME ALGORITHMS; PACKING/COVERING INTEGER PROGRAMS; RANDOMIZED ROUNDING TECHNIQUES;

INTEGER PROGRAMMING;

EID: 0033301160     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796314240     Document Type: Article

References (39)

1. R. AHARONI, P. ERDOS, AND N. LINIAL. Optima of dual integer linear programs, Combinatorica, 8 (1988), pp. 13-20.
2. D. ALDOUS, The Harmonic Mean Formula for probabilities of unions: Applications to sparse random graphs, Discrete Math., 76 (1989), pp. 107-176.
3. N. ALON, J. H. SPENCER, AND P. ERDOS, The Probabilistic Method, Wiley-Interscience, New York, 1992.
4. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings if the ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 294-304.
5. D. BERTSIMAS AND R. VOHRA, Linear programming relaxations, approximation algorithms and randomization; A unified view of covering problems. Technical Report OR 285-94, Massachusetts Institute of Technology, Cambridge, MA, 1994.
6. H. BRÖNNIMANN AND M. T. GOODRICH, Almost optimal set covers in finite VC-dimensions, Discrete Comput. Geom., 14 (1995), pp. 463-479.
7. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
8. V. CHVÁTAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
9. P. CRESCENZI AND V. KANN. A compendium of NP optimization problems, Technical Report SI/RR-95/02, Department of Computer Science, University of Rome "La Sapienza," 1995.
10. G. DOBSON, Worst-case analysis of greedy heuristics for integer programming with nonnegative data, Math. Oper. Res., 7 (1982), pp. 515-531.
11. J. D. ESARY AND F. PROSCHAN, Coherent structures of non-identical components, Technometrics, 5 (1963), pp. 191-209.
12. U. FEIGE, A threshold of ln n for approximating set cover, in Proceedings of the ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 314-318.
13. M. L. FISHER AND L. A. WOLSEY, On the greedy heuristic for continuous covering and packing problems, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 584-591.
14. C. M. FORTUIN, P. W. KASTELEYN, AND J. GINIBRE, Correlational inequalities on some partially ordered sets, Comm. Math. Phys., 22 (1971), pp. 89-103.
15. R. L. GRAHAM, Application of the FKG inequality and its relatives, in Mathematical Programming: The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, New York, 1983.
16. S. GUHA AND S. KHULLER, Greedy strikes back: Improved facility location algorithms, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 649-657.
17. 1-ε, in Proceedings of the IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996. pp. 627-636.
18. D. S. HOCHBAUM, Heuristics for the fixed cost median problem, Math. Programming, 22 (1982), pp. 148-162.
19. W. HOEFFDING, Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J., 58 (1963), pp. 13-30.
20. D. HUNTER, An upper bound for the probability of a union, J. Appl. Probab., 13 (1976), pp. 597-603.
21. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
22. A. KOLEN AND A. TAMIR, Covering problems, in Discrete Location Theory, P. B. Mirchandani and R. L. Francis, eds., Wiley-Interscience, New York, 1990. pp. 263-304.
23. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
24. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
25. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, London, 1995.
26. M. NAOR AND R. M. ROTH, Optimal file sharing in distributed networks, SIAM J. Comput., 24 (1995), pp. 158-183.
27. S. A. PLOTKIN, D. B. SHMOYS, AND É. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
28. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
29. P. RAGHAVAN, Randomized approximation algorithms in combinatorial optimization, in Proceedings of the FST and TCS Conference, 1994, Lecture Notes in Comput. Sci. 880, Springer-Verlag, Berlin, pp. 300-317.
30. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
31. T. K. SARKAR, Some lower bounds of reliability, Technical Report 124, Department of Operations Research and Statistics, Stanford University, Stanford, CA, 1969.
32. D. R. SHIER, Network Reliability and Algebraic Structures, Oxford Science Publications, Oxford University Press, London, 1991.
33. D. B. SHMOYS, É. TARDOS, AND K. AARDAL, Approximation algorithms for facility location problems, in Proceedings of the ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 265-274.
34. P. SLAVÍK, A tight analysis of the greedy algorithm for set cover, J. Algorithms, 25 (1997), pp. 237-254.
35. J. SPENCER, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
36. J. H. SPENCER, Six standard deviations suffice, Trans. Amer. Math. Soc., 289 (1985), pp. 679-706.
37. A. SRINIVASAN, An extension of the Lovász local lemma, and its applications to integer programming, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 6-15.
38. A. SRINIVASAN, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, in Proceedings of the IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 416-425.
39. P. TURÁN, On an extremal problem in graph theory, Mat. Fiz. Lapok, 48 (1941), pp. 436-452.