David G. Harris
Skip Abstract Section
Abstract
The resampling algorithm of Moser and Tardos is a powerful approach to develop constructive versions of the Lovász Local Lemma. We generalize this to partial resampling: When a bad event holds, we resample an appropriately random subset of the variables that define this event rather than the entire set, as in Moser and Tardos. This is particularly useful when the bad events are determined by sums of random variables. This leads to several improved algorithmic applications in scheduling, graph transversals, packet routing, and so on. For instance, we settle a conjecture of Szabó and Tardos (2006) on graph transversals asymptotically and obtain improved approximation ratios for a packet routing problem of Leighton, Maggs, and Rao (1994).
- R. Aharoni, E. Berger, and R. Ziv. 2007. Independent systems of representatives in weighted graphs. Combinatorica 27, 3 (2007), 253--267. Google Scholar
Digital Library
- N. Alon. 1988. The linear arboricity of graphs. Isr. J. Math. 62, 3 (1988), 311--325.Google ScholarCross Ref
- N. Alon. 1992. The strong chromatic number of a graph. Rand. Struct. Algor. 3, 1 (1992), 1--7. Google ScholarDigital Library
- Y. Azar and A. Epstein. 2005. Convex programming for scheduling unrelated parallel machines. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’05) 331--337. Google ScholarDigital Library
- R. Bissacot, R. Fernandez, A. Procacci, and B. Scoppola. 2011. An improvement of the Lovász Local Lemma via cluster expansion. Combin. Probab. Comput. 20--5 (2011), 709--719. Google ScholarDigital Library
- B. Bollobás, P. Erdős, and E. Szemerédi. 1975. On complete subgraphs of r-chromatic graphs. Discr. Math. 13, 2 (1975), 97--107. Google ScholarDigital Library
- A. Chen, D. Harris, and A. Srinivasan. 2016. Partial resampling to approximate covering integer programs. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’16). 1984--2003. Google ScholarDigital Library
- D. Dubhashi and D. Ranjan. 1996. Balls and bins: A study in negative dependence. Random Structures 8 Algorithms 13, 2 (1998), 99--124. Google ScholarDigital Library
- P. Erdős and L. Lovász. 1975. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, Vol. 11 of Colloq. Math. Soc. J. Bolyai. 609--627. North-Holland.Google Scholar
- Alessandra Graf and Penny Haxell. 2018. Finding independent transversals efficiently. arXiv preprint arXiv:1811.02687.Google Scholar
- B. Haeupler, B. Saha, and A. Srinivasan. 2011. New constructive aspects of the Lovász Local Lemma. J. ACM 58, 6 (2011). Google ScholarDigital Library
- D. Harris. 2016. New bounds for the Moser-Tardos distribution. arXiv preprint arXiv:1610.09653.Google Scholar
- D. Harris and A. Srinivasan. 2013. Constraint satisfaction, packet routing, and the Lovász Local Lemma. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC’13). 685--694. Google ScholarDigital Library
- D. Harris and A. Srinivasan. 2013. The Moser-Tardos framework with partial resampling. In Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS’13). 469--478. Google ScholarDigital Library
- D. Harris and A. Srinivasan. 2017. Algorithmic and enumerative aspects of the Moser-Tardos distribution. ACM Trans. Algor. 13, 3 (2017), 33. Google ScholarDigital Library
- D. Harris and A. Srinivasan. 2017. A constructive Lovász Local Lemma for permutations. Theory Comput. 13, 17 (2017), 1--41.Google ScholarCross Ref
- N. J. A. Harvey. 2015. A note on the discrepancy of matrices with bounded row and column sums. Discr. Math. 338, 4 (2015), 517--521. Google ScholarDigital Library
- P. Haxell and T. Szabó. 2006. Odd independent transversals are odd. Combin. Probab. Comput. 15, 1--2 (2006), 193--211. Google ScholarDigital Library
- P. E. Haxell. 2001. A note on vertex list colouring. Combin. Probab. Comput. 10, 4 (2001), 345--348. Google ScholarDigital Library
- P. E. Haxell. 2008. An improved bound for the strong chromatic number. J. Graph Theory 58, 2 (2008), 148--158. Google ScholarDigital Library
- P. E. Haxell, T. Szabó, and G. Tardos. 2003. Bounded size components—Partitions and transversals. J. Combin. Theory B 88, 2 (2003), 281--297. Google ScholarDigital Library
- G. Jin. 1992. Complete subgraphs of r-partite graphs. Combin. Probab. Comput. 1, 3 (1992), 241--250.Google ScholarCross Ref
- R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. 1987. Global wire routing in two-dimensional arrays. Algorithmica 1, 1--4 (1987), 113--129. Google ScholarDigital Library
- F. T. Leighton, C.-J. Lu, S. B. Rao, and A. Srinivasan. 2001. New algorithmic aspects of the local lemma with applications to routing and partitioning. SIAM J. Comput. 31, 2 (2001), 626--641. Google ScholarDigital Library
- F. T. Leighton, B. M. Maggs, and S. B. Rao. 1994. Packet routing and jobshop scheduling in O(congestion + dilation) steps. Combinatorica 14, 2 (1994), 167--186.Google ScholarCross Ref
- J. K. Lenstra, D. B. Shmoys, and É. Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 1--3 (1990), 259--271. Google ScholarDigital Library
- P.-S. Loh and B. Sudakov. 2007. Independent transversals in locally sparse graphs. J. Combin. Theory B 97, 6 (2007), 904--918. Google ScholarDigital Library
- R. Moser and G. Tardos. 2010. A constructive proof of the general Lovász Local Lemma. J. ACM 57, 2 (2010), 1--15. Google ScholarDigital Library
- B. Peis and A. Wiese. 2011. Universal packet routing with arbitrary bandwidths and transit times. In Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO’11). 362--375. Google ScholarDigital Library
- P. Raghavan and C. D. Thompson. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 4 (1987), 365--374. Google ScholarDigital Library
- T. Rothvoß. 2013. A simpler proof for O(congestion + dilation) packet routing. In Proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization (IPCO’13). 336--348. Google ScholarDigital Library
- C. Scheideler. 1998. Universal routing strategies for interconnection networks. In Lecture Notes in Computer Science, Vol. 1390. Springer. Google ScholarDigital Library
- J. P. Schmidt, A. Siegel, and A. Srinivasan. 1995. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discr. Math. 8, 2 (1995), 223--250. Google ScholarDigital Library
- M. Singh. 2008. Iterative Methods in Combinatorial Optimization. Ph.D. Dissertation, Tepper School of Business, Carnegie-Mellon University.Google Scholar
- T. Szabó and G. Tardos. 2006. Extremal problems for transversals in graphs with bounded degree. Combinatorica 26, 3 (2006), 333--351. Google ScholarDigital Library
- R. Yuster. 1997. Independent transversals in r-partite graphs. Discr. Math. 176, 1--3 (1997), 255--261. Google ScholarDigital Library
Index Terms
- The Moser--Tardos Framework with Partial Resampling
Recommendations
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma
The Lopsided Lovász Local Lemma (LLLL) is a powerful probabilistic principle that has been used in a variety of combinatorial constructions. While this principle began as a general statement about probability spaces, it has recently been transformed ...
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution
Moser and Tardos have developed a powerful algorithmic approach (henceforth MT) to the Lovász Local Lemma (LLL); the basic operation done in MT and its variants is a search for “bad” events in a current configuration. In the initial stage of MT, the ...
Moser and tardos meet Lovász
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingBeck's early work [3] gave an efficient version of the Lovász Local Lemma(LLL) with significant compromise in the parameters. Following several improvements [1,7,4,13], Moser [8], and Moser and Tardos [9] obtained asymptotically optimal results in terms ...
Comments