4 citations · 19 across the 11 of their papers we have counts for
7 papers · 1 filter
Improved bounds for coloring locally sparse hypergraphs
Fotis Iliopoulos
We show that, for every , every -uniform hypergaph of degree and girth at least is efficiently -list colorable. As an ap…
Efficiently list-edge coloring multigraphs asymptotically optimally
Fotis Iliopoulos, Alistair Sinclair
We give polynomial time algorithms for the seminal results of Kahn, who showed that the Goldberg-Seymour and List-Coloring conjectures for (list-)edge coloring multigraphs hold asy…
A Local Lemma for Focused Stochastic Algorithms
Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov
We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These are algorithms that search a state space by repeatedly selecting some constrai…
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
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 cons…
Commutative Algorithms Approximate the LLL-distribution
Fotis Iliopoulos
Following the groundbreaking Moser-Tardos algorithm for the Lovasz Local Lemma (LLL), a series of works have exploited a key ingredient of the original analysis, the witness tree l…
Stochastic Control via Entropy Compression
Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis
We consider an agent trying to bring a system to an acceptable state by repeated probabilistic action. Several recent works on algorithmizations of the Lovasz Local Lemma (LLL) can…
Focused Stochastic Local Search and the Lovász Local Lemma
Dimitris Achlioptas, Fotis Iliopoulos
We develop tools for analyzing focused stochastic local search algorithms. These are algorithms which search a state space probabilistically by repeatedly selecting a constraint th…