Improved algorithmic versions of the lovasz Local Lemma

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 611-620

  Srinivasan, Aravind ^a  

^a University of Maryland   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORICS; HYPERGRAPH COLORING; POLYNOMIAL-TIME; RUNNING TIME;

POLYNOMIAL APPROXIMATION;

APPLICATIONS;

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

References (17)

1. A. Ageev and M. Sviridenko, Pipage rounding: a new method of constructing algorithms with proven performance guarantee, Journal of Combinatorial Optimization, 8 (2004), pp. 307-328.
2. N. Alon, A parallel algorithmic version of the Local Lemma, Random Structures & Algorithms, 2 (1991), pp. 367-378.
3. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, 2000.
4. J. Beck, An algorithmic approach to the Lovász Local Lemma, Random Structures & Algorithms, 2 (1991), pp. 343-365.
5. J. Beck and S. Lodha, Efficient proper 2-coloring of almost disjoint hypergraphs, Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 598-605, 2002.
6. A. Chattopadhyay and B. Reed, Properly 2-colouring linear hypergraphs, Proc. RANDOM 2007, Lecture Notes in Computer Science 4627, pages 395-408, 2007.
7. A. Czumaj and C. Scheideler, Coloring non-uniform hypergraphs: A new algorithmic approach to the General Lovász Local Lemma, Random Structures & Algorithms, 17 (2000), pp. 213-237.
8. A. Czumaj and C. Scheideler, A new algorithmic approach to the General Lovdsz Local Lemma with applications to scheduling and satisfiability problems, In Proc. ACM Symposium on Theory of Computing, pages 38-47, 2000.
9. P. Erdös and L. Lová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.
10. U. Feige, M. M. Halldórsson, G. Kortsarz and A. Srinivasan, Approximating the Domatic Number, SIAM Journal on Computing, 32 (2002), pp. 172-195.
11. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan, Dependent Rounding and its Applications to Approximation Algorithms, Journal of the ACM, 53 (2006), pp. 324-360.
12. M. Molloy and B. Reed, Further algorithmic aspects of the Local Lemma, In Proc. ACM Symposium on Theory of Computing, pages 524-529, 1998.
13. M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method, Springer, 2000.
14. S. Pemmaraju and A. Srinivasan, The Randomized Coloring Procedure with Symmetry-Breaking, submitted.
15. J. Radhakrishnan and A. Srinivasan, Improved Bounds and Algorithms for Hypergraph 2-Coloring, Random Structures & Algorithms, 16 (2000), pp. 4-32.
16. M. R. Salavatipour, A (1 +∈)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma, Random Structures & Algorithms, 25 (2004), pp. 68-90.
17. A. Srinivasan, Distributions on level-sets with applications to approximation algorithms, In Proc. IEEE Symposium on Foundations of Computer Science, pages 588-597, 2001.