A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 38-47

  Czumaj, Artur ^a   Scheideler, Christian ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM APPROACHES; APPROXIMATE SOLUTION; EXTENDED ABSTRACTS; INTEGER PROGRAM; JOB-SHOP SCHEDULING; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SATISFIABILITY PROBLEMS;

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; SCHEDULING; ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS;

ALGORITHMS; THEOREM PROVING;

LOVASZ LOCAL LEMMA (LLL); MINIMAX INTEGER PROGRAMS (MIP);

EID: 0033706251     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335310     Document Type: Conference Paper

References (31)

1. N. Alon. A parallel algorithmic version of the local lemma. Random Structures and Algorithms, 2(4):367-387, 1991.
2. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. Journal on Computer and System Science, 43(2):290-298, 1991.
3. N. Alon, C. McDiarmid, and B. Reed. Acyclic coloring of graphs. Random Structures and Algorithms, 2(3):277-288, 1991.
4. N. Alon, J. Spencer, and P. Erdo{combining double acute accent}s. The Probabilistic Method. John Wiley & Sons, New York, 1992.
5. T. Asano, K. Hori, T. Ono, and T. Hirata. A theoretical framework of hybrid approaches to MAX SAT. In Proc. of the 8th Symp. on Algorithms and Computation (ISAAC), pages 153-162, 1997.
6. T. Asano and D. Williamson. Improved approximation algorithms for MAX SAT. In Proc. of the 11th ACM Symp. on Discrete Algorithms (SODA), pages 96-105, 2000.
7. J. Beck. An algorithmic approach to the Lovász local lemma. Random Structures and Algorithms, 2(4):343-365, 1991.
8. A. Z. Broder, A. M. Frieze, and E. Upfal. Static and dynamic path selection on expander graphs: A random walk approach. In Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pages 531-539, 1997.
9. A. Czumaj and C. Scheideler. Coloring non-uniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. In Proc. of the 11th ACM Symp. on Discrete Algorithms (SODA), pages 30-39, 2000.
10. P. Erdo{combining double acute accent}s and L. Lovász. Problems and results on 3-chromatic hypergraphs and some related questions. In A. Hajnal, R. Rado, and V. Sós, editors, Infinite and Finite Sets (to Paul Erdo{combining double acute accent}s on his 60th birthday), pages 609-627. North-Holland, Amsterdam, 1975.
11. P. Erdo{combining double acute accent}s and J. Spencer. Lopsided Lovász local lemma and latin transversals. Discrete Applied Mathematics, 30:151-154, 1991.
12. U. Feige and C. Scheideler. Improved bounds for acyclic job shop scheduling. In Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pages 624-633, 1998.
13. Z. Füredi and J. Kahn. On the dimensions of ordered sets of bounded degree. Order, 3:15-20, 1986.
14. M. Goemans and D. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Computing, 7:656-666, 1994.
15. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
16. L. A. Goldberg, M. Paterson, A. Srinivasan, and E. Sweedyk. Better approximation guarantees for job-shop scheduling. In Proc. of the 8th ACM Symp. on Discrete Algorithms (SODA), pages 599-608, 1997.
17. H. Hind, M. Molloy, and B. Reed. Colouring a graph frugally. Combinatorica, 17(4):469-482, 1997.
18. D. Johnson. Approximation algorithms for combinatorial problems. Journal on Computer and System Science, 9:256-278, 1974.
19. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167-186, 1994.
20. F. T. Leighton, B. M. Maggs, and A. W. Richa. Fast algorithms for finding o(congestion + dilation) packet routing schedules. Technical report, CMU-CS-96-152, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA, 1996.
21. T. Leighton, S. Rao, and A. Srinivasan. New algorithmic aspects of the Local Lemma with applications to routing and partitioning. In Proc. of the 10th ACM Symp. on Discrete Algorithms (SODA), pages 643-652, 1999.
22. C.-J. Lu. A deterministic approximation algorithm for a minmax integer programming problem. In Proc. of the 10th ACM Symp. on Discrete Algorithms (SODA), pages 663-668, 1999.
23. M. Molloy and B. Reed. Further algorithmic aspects of the local lemma. In Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pages 524-529, 1998.
24. J. Radhakrishnan and A. Srinivasan. Improved bounds and algorithms for hypergraph two-coloring. In Proc. of the 39th IEEE Symp. on Foundations of Computer Science (FOCS), pages 684-693, 1998.
25. P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
26. B. Reed. ω, Δ, and χ. Journal of Graph Theory, 27(4):177-212, 1998.
27. J. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223-250, 1995.
28. D. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23(3):617-632, 1994.
29. J. Spencer. Probabilistic methods. In R. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics, chapter 33. Elsevier Science, Amsterdam, 1995.
30. A. Srinivasan. An extension of the Lovász local lemma, and its applications to integer programming. In Proc. of the 7th ACM Symp. on Discrete Algorithms (SODA), pages 6-15, 1996.
31. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994.