An extension of the Lovász local lemma, and its applications to integer programming

SIAM Journal on Computing

Volumn 36, Issue 3, 2006, Pages 609-634

  Srinivasan, Aravind ^a  

^a University of Maryland ^*  (United States)

Author keywords

Approximation algorithms; Column sparse integer programs; Discrepancy; Lov sz local lemma; Randomized rounding

Indexed keywords

COLUMN-SPARSE INTEGER PROGRAMS; RANDOMIZED ROUNDING;

APPROXIMATION ALGORITHMS; CONSTRAINT THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM PROCESSES;

INTEGER PROGRAMMING;

EID: 34250844501     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703434620     Document Type: Article

References (36)

1. N. ALON, A parallel algorithmic version of the local lemma, Random Structures Algorithms, 2 (1991), pp. 367-378.
2. N. ALON, The strong chromatic number of a graph, Random Structures Algorithms, 3 (1992), pp. 1-7.
3. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
4. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., John Wiley and Sons, New York, 2000.
5. J. BECK, An algorithmic approach to the Lovász Local Lemma, Random Structures Algorithms, 2 (1991), pp. 343-365.
6. J. BECK AND T. FIALA, "Integer-making" theorems, Discrete Appl. Math., 3 (1981), pp. 1-8.
7. J. BECK AND J. H. SPENCER, Integral approximation sequences, Math. Program., 30 (1984), pp. 88-98.
8. cn)-wise independence in NC, J. Assoc. Comput. Math., 38 (1991), pp. 1026-1046.
9. A. Z. BRODER, A. M. FRIEZE, AND E. UPFAL, Static and dynamic path selection on expander graphs: A random walk approach, Random Structures Algorithms, 14 (1999), pp. 87-109.
10. V. CHVÁTAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
11. A. CZUMAJ AND C. SCHEIDELER, An algorithmic approach to the general Lovász Local Lemma with applications to scheduling and satisfiability problems, in Proceedings of the ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 38-47.
12. G. DOBSON, Worst-case analysis of greedy heuristics for integer programming with nonnegative data, Math. Oper. Res., 7 (1982), pp. 515-531.
13. M. L. FISHER AND L. A. WOLSEY, On the greedy heuristic for continuous covering and packing problems, SIAM J. Algebraic Discrete Methods, 3 (1982), pp. 584-591.
14. P. ERDOS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and Finite Sets, A. Hajnal et al., eds., Colloq. Math. Soc. J. Bolyai 11, North-Holland, Amsterdam, 1975, pp. 609-627.
15. C. M. FORTUIN, J. GINIBRE, AND P. W. KASTELEYN, Correlational inequalities for partially ordered sets, Comm. of Math. Phys., 22 (1971), pp. 89-103.
16. Z. FÜREDI AND J. KAHN, On the dimensions of ordered sets of bounded degree, Order, 3 (1986), pp. 15-20.
17. H. J. KARLOFF AND D. B. SHMOYS, Efficient parallel algorithms for edge coloring problems, J. Algorithms, 8 (1987), pp. 39-52.
18. R. M. KARP, F. T. LEIGHTON, R. L. RIVEST, C. D. THOMPSON, U. V. VAZIRANI, AND V. V. VAZIRANI, Global wire routing in two-dimensional arrays, Algorithmica, 2 (1987), pp. 113-129.
19. S. G. KOLLIOPOULOS AND N. E. YOUNG, Tight approximation results for general covering integer programs, in Proceedings of the IEEE Symposium on Foundations of Computer Science, Las Vegas, 2001, pp. 522-528.
20. F. T. LEIGHTON, C. J. LU, S. B. RAO, AND A. SRINIVASAN, New algorithmic aspects of the local lemma with applications to routing and partitioning, SIAM J. Comput., 31 (2001), pp. 626-641.
21. F. T. LEIGHTON, S. B. RAO, AND A. SRINIVASAN, Multicommodity flow and circuit switching, in Proceedings of the Hawaii International Conference on System Sciences, Kohala Coast, HI, 1998, pp. 459-465.
22. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
23. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
24. M. MOLLOY AND B. REED, Further algorithmic aspects of the local lemma, in Proceedings of the ACM Symposium on Theory of Computing, Dallas, 1998, pp. 524-529.
25. M. MOLLOY AND B. REED, Graph Coloring and the Probabilistic Method, Springer-Verlag, Berlin, 2002.
26. R. MOTWANI, J. NAOR, AND M. NAOR, The probabilistic method yields deterministic parallel algorithms J. Comput. System Sci., 49 (1994), pp. 478-516.
27. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
28. N. NISAN, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
29. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On the approximability of trade-offs and optimal access of web sources, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, 2000, pp. 86-92.
30. 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.
31. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
32. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
33. J. P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math., 8 (1995), pp. 223-250.
34. J. H. SPENCER, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
35. A. SRINIVASAN, An extension of the Lovász Local Lemma, and its applications to integer programming, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, 1996, pp. 6-15.
36. A. SRINIVASAN, Improved approximation guarantees for packing and covering integer programs, SIAM J. Comput., 29 (1999), pp. 648-670.