Improved algorithmic versions of the Lovász Local Lemma
暂无分享,去创建一个
[1] Christian Scheideler,et al. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma , 2000, SODA '00.
[2] Sachin Lodha,et al. Efficient proper 2-coloring of almost disjoint hypergraphs , 2002, SODA '02.
[3] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[4] ParthasarathySrinivasan,et al. Dependent rounding and its applications to approximation algorithms , 2006 .
[5] Christian Scheideler,et al. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) , 2000, STOC '00.
[6] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[7] Noga Alon. A parallel algorithmic version of the local lemma , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[8] Artur Czumaj,et al. Coloring nonuniform hypergraphs: a new algorithmic approach to the general Lovász local lemma , 2000 .
[9] Bruce A. Reed,et al. Further algorithmic aspects of the local lemma , 1998, STOC '98.
[10] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.
[11] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[12] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[13] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[14] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[15] N. Alon,et al. The Probabilistic Method, Second Edition , 2000 .
[16] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[17] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Aravind Srinivasan,et al. The Randomized Coloring Procedure with Symmetry-Breaking , 2008, ICALP.
[19] Mohammad R. Salavatipour. A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma , 2004, Random Struct. Algorithms.
[20] Bruce A. Reed,et al. Properly 2-Colouring Linear Hypergraphs , 2007, APPROX-RANDOM.
[21] Christian Scheideler,et al. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems , 2000, STOC 2000.
[22] Mohammad R. Salavatipour,et al. A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma , 2003, SODA '03.