An algorithmic approach to the lovász local lemma. I

Authors:
József Beck
Affiliations:
Eötvös Loránd University, Department of Mathematics, Budapest, Múzeum krt. 6‐8, Hungary 1088 and Rutgers University, Department of Mathematics, Hill Center, Busc ...
Venue:
Random Structures & Algorithms
Year:
1991

Citing 0
Cited 17

Sample spaces uniform on neighborhoods

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Paul Erdös (1913-996): his influence on the theory of computing

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating the domatic number

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Asymptotically optimal frugal colouring

Journal of Combinatorial Theory Series B
Moser and tardos meet Lovász

Proceedings of the forty-third annual ACM symposium on Theory of computing
Hardness of Approximating Flow and Job Shop Scheduling Problems

Journal of the ACM (JACM)
A kolmogorov complexity proof of the lovász local lemma for satisfiability

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Bandwidth and low dimensional embedding

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
New Constructive Aspects of the Lovász Local Lemma

Journal of the ACM (JACM)
Space-efficient local computation algorithms

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The lovász-local-lemma and scheduling

Efficient Approximation and Online Algorithms
Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review
Converting online algorithms to local computation algorithms

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A quantum Lovász local lemma

Journal of the ACM (JACM)
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability

Theoretical Computer Science
Bandwidth and low dimensional embedding

Theoretical Computer Science
Fast distributed coloring algorithms for triangle-free graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Lovász Local Lemma is a remarkable sieve method to prove the existence of certain structures without supplying any efficient way of finding these structures. In this article we convert some of the applications of the Local Lemma into polynomial time sequential algorithms (at the cost of a weaker constant factor in the “exponent”). Our main example is the following: assume that in an n‐uniform hypergraph every hyperedge intersects at most 2n/48 other hyperedges, then there is a polynomial time algorithm that finds a two‐coloring of the points such that no hyperedge is monochromatic. © 1991 Wiley Periodicals, Inc.