The Moser-Tardos Framework with Partial Resampling
Combinatorics
2023-10-13 v5 Data Structures and Algorithms
Abstract
The resampling algorithm of Moser \& Tardos is a powerful approach to develop constructive versions of the Lov\'{a}sz Local Lemma (LLL). 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 & 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 etc. For instance, we settle a conjecture of Szab\'{o} & Tardos (2006) on graph transversals asymptotically, and obtain improved approximation ratios for a packet routing problem of Leighton, Maggs, & Rao (1994).
Cite
@article{arxiv.1406.5943,
title = {The Moser-Tardos Framework with Partial Resampling},
author = {David G. Harris and Aravind Srinivasan},
journal= {arXiv preprint arXiv:1406.5943},
year = {2023}
}