Focused Stochastic Local Search and the Lovász Local Lemma

DOI10.1137/1.9781611974331.ch141zbMath1410.68338arXiv1507.07633OpenAlexW4211265127MaRDI QIDQ4575726

Fotis Iliopoulos, Demetrios Achlioptas

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial probability (60C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (7)

The list chromatic number of graphs with small clique number ⋮ Commutativity in the Algorithmic Lovász Local Lemma ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ On triangle-free list assignments ⋮ Unnamed Item ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ A Local Lemma for Focused Stochastic Algorithms

This page was built for publication: Focused Stochastic Local Search and the Lovász Local Lemma