On the Power of Nodes of Degree Four in the Local Max-Cut Problem
暂无分享,去创建一个
[1] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] William J. Cook,et al. Combinatorial optimization , 1997 .
[3] E LadnerRichard. The circuit value problem is log space complete for P , 1975 .
[4] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[5] Andrea Vattani. k-means Requires Exponentially Many Iterations Even in the Plane , 2011, Discret. Comput. Geom..
[6] Fan Chung Graham,et al. Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.
[7] Zsolt Tuza,et al. Maximum cuts and largest bipartite subgraphs , 1993, Combinatorial Optimization.
[8] Andreas S. Schulz,et al. On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games , 2006, WINE.
[9] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, FOCS.
[10] Michael Luby,et al. Steepest Descent Can Take Exponential Time for Symmetric Connection Networks , 1988, Complex Syst..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[13] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[14] Emile H. L. Aarts,et al. Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.
[15] Svatopluk Poljak. Integer Linear Programs and Local Search for Max-Cut , 1995, SIAM J. Comput..
[16] Martin Loebl,et al. Efficient Maximal Cubic Graph Cuts (Extended Abstract) , 1991, ICALP.
[17] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[18] Mark W. Krentel,et al. Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.
[19] Rahul Savani,et al. Hard‐to‐Solve Bimatrix Games , 2006 .
[20] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[21] Vahab S. Mirrokni,et al. Convergence and approximation in potential games , 2012, Theor. Comput. Sci..
[22] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.
[23] Pekka Orponen,et al. Complexity Issues in Discrete Hopfield Networks , 1994 .
[24] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[25] Berthold Vöcking,et al. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.
[26] Vahab S. Mirrokni,et al. Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[27] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[28] Emile H. L. Aarts,et al. Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) , 2007 .