An extension of the Lovász Local Lemma, and its applications to integer programming

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 6-15

  Srinivasan, Aravind ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY;

COVERING INTEGER PROGRAM; FEASIBLE SOLUTION; INTEGER PROGRAM; ITS APPLICATIONS; LINEAR RELAXATIONS; NON-ZERO PROBABILITY; PACKING AND COVERINGS; RANDOMIZED ROUNDING;

INTEGER PROGRAMMING;

EID: 85013574565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. N. Alori, A parallel algorithmic version of the Local Lemma, Random Structures and Algorithms, 2 (1991), pp. 367-378.
2. N. Alon, The strong chromatic number of a graph, Random Structures and 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, Journal of Algorithms, 7 (1986), pp. 567-583.
4. N. Alon, J. H. Spencer, and P. Erdos, The Probabilistic Method, John Wiley & Sons, 1992.
5. J. Beck, An algorithmic approach to the Lovdsz Local Lemma, Random Structures and Algorithms, 2 (1991), pp. 343-365.
6. J. Beck and T. Fiala, "Integer-making" theorems, Discrete Applied Mathematics, 3 (1981), pp. 1-8.
7. J. Beck and J. H. Spencer, Integral approximation sequences, Mathematical Programming, 30 (1984), pp. 88-98.
8. c n)-wise independence in NC, JACM, 38 (1991), pp. 1026-1046.
9. R. B. Boppana and J. H. Spencer, A useful elementary correlation inequality, Journal of Combinatorial Theory, Series A, 50 (1989), pp. 305-307.
10. V. Chvátal, A greedy heuristic for the set covering problem, Math. of O.R., 4 (1979), pp. 233-235.
11. G. Dobson, Worst-case analysis of greedy heuristics for integer programming with nonnegative data, Math. of O.R., 7 (1982), pp. 515-531.
12. M. L. Fisher and L. A. Wolsey, On the greedy heuristic for continuous covering and packing problems, SIAM J. on Algebraic and Discrete Methods, 3 (1982), pp. 584-591.
13. P. Erdos and L. Lóvász, Problems and results on 3-chromatic hypergraphs and some related questions, In Infinite and Finite Sets, A. Hajnal et al., eds., Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, 1975, pp. 609-627.
14. C. M. Fortuin, J. Ginibre, and P. N. Kasteleyn, Correlational inequalities for partially ordered sets, Communications of Mathematical Physics, 22 (1971), pp. 89-103.
15. Z. Füredi and J. Kahn, On the dimensions of ordered sets of bounded degree, Order, 3 (1986), pp. 15-20.
16. S. Janson, T. Luczak and A. Rucinski, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, In Random Graphs '87, Karonski et al., eds., John Wiley & Sons, Chichester, 1990, pp. 73-87.
17. H. J. Karloff and D. B. Shmoys, Efficient parallel algorithms for edge coloring problems, Journal of 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. F. T. Leighton, B. Maggs, and S. B. Rao, Packet routing and jobshop scheduling in O (congestion + dilation) steps, Combinatorica, 14 (1994), pp. 167-186.
20. F. T. Leighton and B. Maggs, Fast algorithms for finding O(congestion+dilation) packet routing schedules, Manuscript, 1995.
21. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
22. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
23. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, Journal of Computer and System Sciences, 49 (1994), pp. 478-516.
24. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
25. S. A. Plotkin, D. B. Shmoys, and É. Tardos, Fast approximation algorithms for fractional packing and covering problems, In Proc. IEEE FOCS Symposium, pp. 495-504, 1991.
26. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, 37 (1988), pp. 130-143.
27. P. Raghavan and C. D. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
28. T. K. Sarkar. Some lower bounds of reliability, Technical Report 124, Department of Operations Research and Statistics, Stanford University, 1969.
29. J. P. Schmidt, A. Siegel, and A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, SIAM Journal on Discrete Mathematics, 8 (1995), pp. 223-250.
30. J. H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
31. A. Srinivasan, Improved approximations of packing and covering problems, In Proc. ACM Symposium on Theory of Computing, pp. 268-276, 1995.