Locally Checkable Labeling (LCL) problems include essentially all the classic problems of $\mathsf {LOCAL} $ distributed algorithms. In a recent enlightening revelation, Chang and …
H Guo, M Jerrum, J Liu - Journal of the ACM (JACM), 2019 - dl.acm.org
We propose a new algorithmic framework, called partial rejection sampling, to draw samples exactly from a product distribution, conditioned on none of a number of bad events …
KM Chung, S Pettie, HH Su - Proceedings of the 2014 ACM symposium …, 2014 - dl.acm.org
The Lovasz Local Lemma (LLL), introduced by Erdos and Lovasz in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n" bad" events do not …
In (Ref. 1),(Ref. 2) it was noticed that sometimes it takes BGP a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. In …
W Feng, K He, Y Yin - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lovász local lemma …
We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly. Our work is inspired by Moser's …
K He, X Sun, K Wu - arXiv preprint arXiv:2107.03932, 2021 - arxiv.org
We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lov\'asz local lemma conditions where each …
S Sandeep - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
Multidimensional packing problems generalize the classical packing problems such as Bin Packing, Multiprocessor Scheduling by allowing the jobs to be d-dimensional vectors. While …
Following the groundbreaking algorithm of Moser and Tardos for the Lovasz Local Lemma (LLL), there has been a plethora of results analyzing local search algorithms for various …