Constraint satisfaction, packet routing, and the lovasz local lemma
暂无分享,去创建一个
[1] Richard M. Karp,et al. Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Joel H. Spencer,et al. A useful elementary correlation inequality , 1989, J. Comb. Theory, Ser. A.
[3] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[4] Aravind Srinivasan,et al. New Constructive Aspects of the Lovasz Local Lemma , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[5] Mario Szegedy,et al. Moser and tardos meet Lovász , 2011, STOC '11.
[6] Aravind Srinivasan,et al. New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.
[7] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..
[8] Wesley Pegden. An Extension of the Moser-Tardos Algorithmic Local Lemma , 2014, SIAM J. Discret. Math..
[9] Wesley Pegden. An improvement of the Moser-Tardos algorithmic local lemma , 2011, ArXiv.
[10] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[11] Noga Alon,et al. The Probabilistic Method, Third Edition , 2008, Wiley-Interscience series in discrete mathematics and optimization.
[12] Christian Scheideler,et al. Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.
[13] Aaron Archer,et al. On the upper chromatic numbers of the reals , 2000, Discret. Math..
[14] P. Duchet,et al. A Few Remarks on Orientation of Graphs and Ramsey Theory , 1989 .
[15] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[16] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[17] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[18] Andreas Wiese,et al. Universal Packet Routing with Arbitrary Bandwidths and Transit Times , 2011, IPCO.
[19] Thomas Rothvoß. A simpler proof for O(congestion + dilation) packet routing , 2012, ArXiv.
[20] James B. Shearer,et al. On a problem of spencer , 1985, Comb..
[21] Gábor Tardos,et al. Bounded size components--partitions and transversals , 2003, J. Comb. Theory, Ser. B.
[22] N. Alon. The linear arboricity of graphs , 1988 .
[23] Y. Kohayakawa,et al. Ramsey Properties of Orientations of Graphs , 1993, Random Struct. Algorithms.
[24] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..
[25] Penny Haxell,et al. A Note on Vertex List Colouring , 2001, Combinatorics, Probability and Computing.
[26] Gábor Tardos,et al. The local lemma is tight for SAT , 2010, SODA '11.
[27] C. Fortuin,et al. Correlation inequalities on some partially ordered sets , 1971 .
[28] Peter Jeavons,et al. Constraint Satisfaction Problems and Finite Algebras , 2000, ICALP.
[29] Thomas Rothvoß. A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing , 2013, IPCO.
[30] Paul Erdös,et al. Split and balanced colorings of complete graphs , 1999, Discret. Math..
[31] Aravind Srinivasan,et al. An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.
[32] On a problem of , 2005 .
[33] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.