New Constructive Aspects of the Lovasz Local Lemma
暂无分享,去创建一个
[1] Uriel Feige,et al. Santa Claus Meets Hypergraph Matchings , 2008, APPROX-RANDOM.
[2] Venkatesan Guruswami,et al. MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.
[3] Noga Alon,et al. A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.
[4] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[5] Robin A. Moser. Derandomizing the Lovasz Local Lemma more effectively , 2008, ArXiv.
[6] Robin A. Moser. A constructive proof of the Lovász local lemma , 2008, STOC '09.
[7] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[8] Aravind Srinivasan,et al. A new approximation technique for resource‐allocation problems , 2010, ICS.
[9] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[10] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Aravind Srinivasan. Improved algorithmic versions of the Lovász Local Lemma , 2008, SODA '08.
[12] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.
[13] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[14] Bruce A. Reed,et al. Further algorithmic aspects of the local lemma , 1998, STOC '98.
[15] N. Alon,et al. The Probabilistic Method: Alon/Probabilistic , 2008 .
[16] Sanjeev Khanna,et al. On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[17] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[18] Uriel Feige,et al. On allocations that maximize fairness , 2008, SODA '08.
[19] Uriel Feige,et al. On Estimation Algorithms vs Approximation Algorithms , 2008, FSTTCS.
[20] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[21] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[22] Penny E. Haxell,et al. A condition for matchability in hypergraphs , 1995, Graphs Comb..