On the power of nodes of degree four in the local max-cut problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6078 LNCS, Issue , 2010, Pages 264-275

  Monien, Burkhard ^a   Tscheuschner, Tobias ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Complexity; Degree four; Local search; Max cut; PLS

Indexed keywords

ARBITRARY GRAPHS; CUBIC GRAPH; EXPONENTIAL TIME; INITIAL SOLUTION; LOCAL OPTIMA; LOCAL SEARCH; MAX-CUT; MAX-CUT PROBLEM; MAXIMUM DEGREE; POLYNOMIAL LENGTH; COMPLEXITY; DEGREE FOUR; MAX CUT;

GRAPHIC METHODS; COMPUTATIONAL COMPLEXITY;

GRAPHIC METHODS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION;

EID: 77953781723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13073-1_24     Document Type: Conference Paper

References (23)

1. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS, pp. 295-304 (2004)
2. Ackermann, H., Röglin, H., Vöcking, B.: On the Impact of Combinatorial Structure on Congestion Games. JACM Art. 25, 55(6) (2008)
3. Awerbuch, B., Azar, Y., Epstein, A., Mirokkni, V.S., Skopalik, A.: Fast Convergence to Nearly Optimal Solutions in Potential Games. In: Conference on Electronic Commerce (EC), pp. 264-273 (2008)
4. Dunkel, J., Schulz, A.S.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.4286, pp. 62-73. Springer, Heidelberg (2006)
5. Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.3884, pp. 349-360. Springer, Heidelberg (2006)
6. Englert, M., Röglin, H., Vöcking, B.: Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. In: SODA, pp. 1295-1304 (2006)
7. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash Equilibria. In: STOC, pp. 604-612 (2004)
8. Floreen, P., Orponen, P.: Complexity Issues in Discrete Hopfield Networks. NeuroCOLT Technical Report Series, NC-TR-94-1009 (October 1994)
9. Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
10. Goemans, M., Mirokkni, V., Vetta, A.: Sink Equilibria and Convergence. In: FOCS, pp. 142-154 (2005)
11. Haken, A.: Connectionist Networks that need exponential time to stabilize. Unpublished manuscript, Dept. of Computer Science, University of Toronto (1989)
12. Haken, A., Luby, M.: Steepest Descent Can Take Exponential Time for Symmetric Connection Networks. Complex Systems 2, 191-196 (1988)
13. Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? JCSS 37(1), 79-100 (1988)
14. Krentel, M.: Structure in locally optimal solutions. In: FOCS, pp. 216-221 (1989)
15. Ladner, R.: The circuit value problem is log space complete for P. SIGACT News 7(1), 18-20 (1975)
16. Loebl, M.: Efficient maximal cubic graph cuts. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.510, pp. 351-362. Springer, Heidelberg (1991)
17. Michiels, W., Aarts, E., Korst, J.: Theoretical aspects of local search. Springer, New York (2007)
18. Poljak, S.: Integer linear programs and local search for max-cut. SIAM Journal on Computing 21(3), 450-465 (1995)
19. Poljak, S., Tuza, Z.: Maximum cuts and largest bipartite subgraphs. In: Combinatorial Optimization, pp. 181-244. American Mathematical Society, Providence (1995)
20. Rosenthal, R.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65-67 (1973)
21. Savani, R., von Stengel, B.: Hard-To-Solve Bimatrix Games. Econometrica 74, 397-429 (2006)
22. Schäffer, A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing 20(1), 56-87 (1991)
23. Vattani, A.: k-means Requires Exponentially Many Iterations Even in the Plane. In: Proceedings of the 25th annual symposium on Computational geometry, pp. 324-332 (2009)