Polynomial time approximation schemes for max-bisection on planar and geometric graphs

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 110-119

  Jansen, Klaus ^a   Karpinski, Marek ^b   Lingas, Andrzej ^c   Seidel, Eike ^a  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF BONN   (Germany)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Approximation algorithms; Combinatorial optimization; Graph bisection; NP hardness; Planar graphs; Polynomial time approximation schemes

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; OPTIMIZATION;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH BISECTION; NP-HARDNESS; PLANAR GRAPHS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

POLYNOMIAL APPROXIMATION;

EID: 33644603112     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970139567X     Document Type: Article

References (23)

1. S. ARNBORG, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey, BIT, 25 (1985), pp. 2-23.
2. S. ARORA, D. KARGER, AND M. KARPINSKI, Polynomial time approximation schemes for dense instances of NP-hard problems, 3, Comput. System Sci., 58 (1999), pp. 193-210.
3. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., 41 (1994), pp. 153-180.
4. F. BARAHONA, On the computational complexity of Ising spin glass models, J. Phys. A., 15 (1982), pp. 3241-3253.
5. H. L. BODLAENDER, A tourist guide through treewidth, Acta Cybernet., 11 (1993), pp. 1-23.
6. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
7. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1-47.
8. H. L. BODLAENDER, private communication, 2000.
9. H. L. BODLAENDER AND K. JANSEN, On the complexity of the Maximum Cut problem, Nordic J. Comput., 7 (2000), pp. 14-31.
10. U. FEIGE, M. KARPINSKI, AND M. LANGBERG, A note on approximating Max-Bisection on regular graphs, Inform. Process. Lett., 79 (2001), pp. 181-188.
11. U. FEIGE AND R. KRAUTHGAMER, A polylogarithmic approximation of the minimum bisection, SIAM J. Comput., 31 (2002), pp. 1090-1118.
12. A. FRIEZE AND M. JERRUM, Improved approximation algorithms for MAX k-CUT and MAX BISECTION, Algorithmica, 18 (1997), pp. 67-81.
13. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
14. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
15. F. HADLOCK, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput., 4 (1975), pp. 221-225.
16. E. HALPERIN AND U. ZWICK, A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems, Random Structures Algorithms, 20 (2002), pp. 382-402.
17. H. B. HUNT, M. V. MARATHE, V. RADHAKRISHNAN, S. S. RAVI, D. S. ROSENKRANTZ, AND R. E. STEARNS, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, J. Algorithms, 26 (1998), pp. 238-274.
18. M. JERRUM, private communication, 2000.
19. M. KARPINSKI, M. KOWALUK, AND A. LINGAS, Approximation algorithms for max-bisection on low degree regular graphs, Fund. Inform., 62 (2004), pp. 369-375.
20. S. KHANNA AND R. MOTWANI, Towards a syntactic characterization of PTAS, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 329-337.
21. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
22. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
23. Y. YE, A O.699-approximation algorithm for Max-Bisection, Math. Program., 90 (2001), pp. 101-111.