Approximation algorithms for the vertex bipartization problem

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

Volumn 1338, Issue , 1997, Pages 547-554

  Schroder H ^a   May, A E ^a   Vrto, I ^b   Sykora O ^b  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; INFORMATION SCIENCE; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

BIPARTIZATION; COLORING ALGORITHMS; CONNECTED GRAPH; NP COMPLETE; POLYNOMIAL-TIME; VERTEX COLORING;

APPROXIMATION ALGORITHMS;

EID: 38149088643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63774-5_137     Document Type: Conference Paper

References (6)

1. Goemans, M. X., Williamson, D. P.: 0. 878 approximation algorithm for maxcut and max-2-sat. Proc. 26th Annual ACM Symposium on the Theory of Computing (May 1994) 422-431.
2. Hadlock, F. O.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 (1975) 221-225.
3. Haglin, D. J., Venkatesan, S. M.: Approximation and intractability results for the maximum cut problem and its variants. IEEE Transactions on Computers 40 (1991) 110-113.
4. Poljak, S., Tuza, Z.: The max-cut problem-a survey. (Technical Report), Academia Sinica, Taipei, Taiwan, January 1994 (a shorter version under title: Maximum cuts and largest bipartite subgraphs was published in Combinatorial Optimization, Eds.: Cook, W., Lovasz, L. and Seymour, P., Providence, RI (1995) 181-244).
5. Sahni, S., Gonzales, T.: P-complete approximation problems. Journal of the ACM 23 (1976) 555-565.
6. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan and Mario Szegedy: Proof verification and intractability of approximation problems. Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (1992) 14-23.