A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

DOI10.1145/335305.335310zbMath1296.90135OpenAlexW2159255281MaRDI QIDQ3191969

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335310

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Minimax problems in mathematical programming (90C47) Approximation algorithms (68W25)

Related Items (7)

[https://portal.mardi4nfdi.de/wiki/Publication:4810508 A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma] ⋮ How Many Conflicts Does It Need to Be Unsatisfiable? ⋮ Unnamed Item ⋮ Testing hypergraph colorability ⋮ On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ The Lovász Local Lemma and Satisfiability

This page was built for publication: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)