A 2|E|/4-time algorithm for max-cut

Journal of Mathematical Sciences

Volumn 126, Issue 3, 2005, Pages 1200-1204

  Kulikov, A S ^a   Fedin, S S ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144363948     PISSN: 10723374     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10958-005-0101-7     Document Type: Article

References (8)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and hardness of approximation problems," in: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (1992), pp. 14-23.
2. F. Barahona, M. Grotschel, M. Jünger, and G. Reinelt, "An application of combinatorial optimization to statistical physics and circuit layout design," Oper. Res., 36, 493-513 (1988).
3. E. Ya. Dantsin, E. A. Hirsch, S. V. Ivanov, and M. A. Vsemirnov, "Algorithms for SAT and upper bounds on their complexity," Zap. Nauchn. Semin. POMI, 277, 14-46 (2001).
4. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith, "New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT," Technical Report 00-037, Electronic Colloquium on Computational Complexity (2000).
5. R. M. Karp, "Reducibility among combinatorial problems," in: Complexity of Computations, R. Miller and J. Thatcher (eds.), Plenum Press, New York (1972), pp. 85-103.
6. S. Poljak and Z. Tuza, "Maximum cuts and large bipartite subgraphs," DIMACS Ser. Discrete Math. Theor. Comput. Sci., 20, 181-244 (1995).
7. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Sys. Sci., 43, 425-440 (1991).
8. U. Zwick, personal communication to the authors of [4] (2000).