Approximation algorithms for max-bisection on low degree regular graphs

Fundamenta Informaticae

Volumn 62, Issue 3-4, 2004, Pages 369-375

  Karpinski, Marek ^a   Kowaluk, Miroslaw ^b   Lingas, Andrzej ^c  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Approximation algorithms; Graph bisection; Regular graphs

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; SET THEORY;

APPROXIMATION ALGORITHMS; GRAPH BISECTION; MAX-BISECTION; REGULAR GRAPHS;

ALGORITHMS;

EID: 24044459262     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. A.A. Ageev and M.I. Sviridenko. Approximation algorithms for Maximum Coverage and Max Cut with cardinality constraints. Proceedings of 1PC099, Lecture Notes in Computer Science 1610, pp. 17-30, 1999.
2. S. Arora, D. Karger and M. Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems, Proceedings 27th ACM STOC, pp. 284-293, 1995.
3. K. Diks, H.N. Djidjev, O. Sykora and I. Vrto. Edge Separators of Planar and Outerplanar Graphs with Applications. Journal of Algorithms 14, pp. 258-279 (1993).
4. U. Feige, M. Karpinski and M. Langberg. Improved Approximation of Max-Cut on Graphs of Bounded Degree. ECCC (http://www.eccc.uni-trier.de/eccc/), TR00-021 (2000), also in J. of Algorithms 43(2002), pp. 201-219.
5. U. Feige, M. Karpinski and M. Langberg. A Note on Approximating MAX-BISECTION on Regular Graphs. Information Processing Letters 79 (2001), pp. 181-188.
6. A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, pp. 67-81, 1997.
7. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42, pp. 1115-1145, 1995.
8. F. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. Vol. 4, No. 3, pp. 221-225, 1975.
9. MAX-CUT in Cubic Graphs. E. Halperin, D. Livnat, and U. Zwick. Proc. 13th ACM-SIAM SODA (2002), pp. 506-513.
10. E. Halperin and U. Zwick, Improved approximation algorithms for maximum graph bisection problems, Manuscript, 2000.
11. K. Jansen, M. Karpinski and A. Lingas and E. Seidel. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Proc. STACS'2001, February 2001, Lecture Notes in Computer Science, Springer Verlag.
12. S. Khanna and R. Motwani. Towards a Syntactic Characterization of PTAS. Proceedings of the 28th ACM STOC, 1996, pp. 329-337.
13. R.J. Lipton and R.E. Tarjan. Applications of a planar separator theorem. SIAM J. Comput. Vol. 9, No. 3, pp. 615-627, 1980.
14. S. Mahajan and J. Ramesh. Derandomizing semidefinite programming based approximation algorithms. Proceedings of the 36th IEEE FOCS, pp. 162-169, 1995.
15. Y. Ye, A O.699 - approximation algorithm for Max-Bisection, Submitted to Math Programming, available at URL http://dollar.biz.uiowa.edu/col/ye, 1999