An exact algorithm for MAX-CUT in sparse graphs

Operations Research Letters

Volumn 35, Issue 3, 2007, Pages 403-408

  Della Croce, F ^a   Kaminski, M J ^b   Paschos, V Th ^c  

^a POLITECNICO DI TORINO   (Italy)

^b RUTGERS UNIVERSITY   (United States)

^c Centre National de la Recherche Scientifique   (France)

Author keywords

Exact algorithm; MAX CUT; Sparse graphs

Indexed keywords

COMPUTATIONAL METHODS; GRAPHIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL SPACE; SPARSE GRAPHS; TIME COMPLEXITY;

ALGORITHMS;

EID: 34247137897     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.04.001     Document Type: Article

References (13)

1. Bodlaender H.L., and Jansen K. On the complexity of the maximum cut problem. Nordic J. Comput. 7 1 (2000) 14-31
2. | E | / 4-time algorithm for max-cut. J. Math. Sci. 126 (3) (2005) 1200-1204.
3. Gramm J., Hirsch E.A., Niedermaier R., and Rossmanith P. Worst-case upper bounds for Max2Sat with an application to MaxCut. Discrete Appl. Math. 130 (2003) 139-155
4. J. Kneis, P. Rossmanith, A new satisfiablity algorithm with applications to max-cut, Technical Report AIB-2005-08, Department of Computer Science, RWTH Aachen.
5. Lovász L. Three short proofs in graph theory. J. Combin. Theory Ser. B 19 (1975) 269-271
6. Poljak S., and Tuza Z. Maximum cuts and large bipartite subgraphs. In: Cook W., Lovász L., and Seymour P. (Eds). Combinatorial Optimization. Papers from the DIMACS Special Year (1995), American Mathematical Society, Providence, RI 181-224
7. Sakai S., Togasaki M., and Yamazaki K. A note on greedy algorithms for the maximum weighted independent set problem. Discrete Appl. Math. 126 (2003) 313-322
8. Schrijver A. Theory of Linear and Integer Programming (1999), Wiley, New York
9. Scott A.D., and Sorkin G.B. Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. Proceedings of RANDOM'03, Lecture Notes in Computer Science vol. 2764 (2003), Springer, Berlin 382-395
10. A.D. Scott, G.B. Sorkin, Solving sparse semi-random instances of Max-Cut and Max-CSP in linear expected time, Research Report 23417 (W0411-056), IBM Research division, Thomas J. Watson Research Center, 2004.
11. R. Williams, A new algorithm for optimal 2-constraint satisfaction and its implications, Theoret. Comput. Sci. 348 (2-3) (2005) 357-365.
12. Woeginger G.J. Space and time complexity of exact algorithms: some open problems. Proceedings of IWPEC'04, Lecture Notes in Computer Science vol. 3162 (2004), Springer, Berlin 281-290
13. Yannakakis M. Node- and edge-deletion NP-complete problems. Proceedings of STOC'78 (1978) 253-264