文章基本信息

标题：Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion
本地全文：下载
作者：Dimitris Achlioptas ; Themis Gouleakis
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2012
卷号：18
页码：16-23
DOI：10.4230/LIPIcs.FSTTCS.2012.16
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The Lovasz Local Lemma (LLL) is a powerful tool that can be used to prove that an object having none of a set of bad properties exists, using the probabilistic method. In many applications of the LLL it is also desirable to explicitly construct the combinatorial object. Recently it was shown that this is possible using a randomized algorithm in the full asymmetric LLL setting [R. Moser and G. Tardos, 2010]. A strengthening of the LLL for the case of dense local neighborhoods proved in [R. Bissacot et al., 2010] was recently also made constructive in [W. Pegden, 2011]. In another recent work [B. Haupler, B. Saha, A. Srinivasan, 2010], it was proved that the algorithm of Moser and Tardos is still efficient even when the number of events is exponential. Here we prove that these last two contributions can be combined to yield a new version of the LLL.
关键词：Probabilistic Method; Lov{\'a