A New Notion of Commutativity for the Algorithmic Lovász Local Lemma

DOI10.4230/lipics.approx/random.2021.31arXiv2008.05569OpenAlexW3201983373MaRDI QIDQ6090906

David G. Harris, Vladimir Kolmogorov, Fotis Iliopoulos

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2008.05569

zbMATH Keywords

resamplingcommutativityLovász local lemmaLatin transversalMoser-Tardos algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel

This page was built for publication: A New Notion of Commutativity for the Algorithmic Lovász Local Lemma