The Community for Technology Leaders
2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) (2015)
Berkeley, CA, USA
Oct. 17, 2015 to Oct. 20, 2015
ISSN: 0272-5428
ISBN: 978-1-4673-8191-8
pp: 1327-1346
ABSTRACT
The Lovasz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events. Finding such an outcome by an efficient algorithm has been an active research topic for decades. Breakthrough work of Moser and Tardos (2009) presented an efficient algorithm for a general setting primarily characterized by a product structure on the probability space. In this work we present an efficient algorithm for a much more general setting. Our main assumption is that there exist certain functions, called resampling oracles, that can be invoked to address the undesired occurrence of the events. We show that, in all scenarios to which the original Lovasz Local Lemma applies, there exist resampling oracles, although they are not necessarily efficient. Nevertheless, for essentially all known applications of the Lovasz Local Lemma and its generalizations, we have designed efficient resampling oracles. As applications of these techniques, we present new results for packings of Latin transversals, rainbow matchings and rainbow spanning trees.
INDEX TERMS
Algorithm design and analysis, Heuristic algorithms, Computer science, Transportation, Probabilistic logic, Extraterrestrial measurements
CITATION

N. J. Harvey and J. Vondrak, "An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles," 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, USA, 2015, pp. 1327-1346.
doi:10.1109/FOCS.2015.85
93 ms
(Ver 3.3 (11022016))