Settling the Complexity of Local Max-Cut (Almost) Completely
暂无分享,去创建一个
[1] Shang-Hua Teng,et al. Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.
[2] Roman Vershynin,et al. Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[3] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[4] Burkhard Monien,et al. On the Power of Nodes of Degree Four in the Local Max-Cut Problem , 2010, CIAC.
[5] John Dunagan,et al. Smoothed analysis of the perceptron algorithm for linear programming , 2002, SODA '02.
[6] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[7] Mark W. Krentel,et al. Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] Rahul Savani,et al. Computing Stable Outcomes in Hedonic Games , 2010, SAGT.
[9] Berthold Vöcking,et al. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.
[10] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.
[11] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, FOCS.
[12] D. Spielman,et al. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .
[13] Bodo Manthey,et al. k-Means Has Polynomial Smoothed Complexity , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[14] Evdokia Nikolova,et al. On the Hardness and Smoothed Complexity of Quasi-Concave Minimization , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[15] René Beier,et al. Typical properties of winners and losers in discrete optimization , 2004, STOC '04.
[16] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[17] Berthold Vöcking,et al. Smoothed analysis of integer programming , 2007, Math. Program..
[18] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[19] René Beier,et al. Typical Properties of Winners and Losers in Discrete Optimization , 2006, SIAM J. Comput..
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[22] E LadnerRichard. The circuit value problem is log space complete for P , 1975 .
[23] Zsolt Tuza,et al. Maximum cuts and largest bipartite subgraphs , 1993, Combinatorial Optimization.
[24] Svatopluk Poljak. Integer Linear Programs and Local Search for Max-Cut , 1995, SIAM J. Comput..
[25] Burkhard Monien,et al. Local Search: Simple, Successful, But Sometimes Sluggish , 2010, ICALP.
[26] Martin Loebl,et al. Efficient Maximal Cubic Graph Cuts (Extended Abstract) , 1991, ICALP.