Constant factor approximation of vertex-cuts in planar graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 90-99

  Amir, Eyal ^a   Krauthgamer, Robert ^a   Rao, Satish ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Balanced cut; Planar graph; Planar separator; Quotient cut; Vertex separator

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

PLANAR GRAPHS;

GRAPH THEORY;

EID: 0038447036     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780557     Document Type: Conference Paper

References (25)

1. C. Ababei, N. Selvakkumaran, K. Bazargan, and G. Karypis. Multi-objective circuit partitioning for cutsize and path-based delay minimization. In International Conference on Computer-Aided Design, pages 181-186, 2002.
2. N. Alon, P. Seymour, and R. Thomas. Planar separators. SIAM J. Discrete Math., 7(2):184-193, 1994.
3. E. Amir. Efficient approximation for triangulation of minimum treewidth. In Proc. Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI '01), pages 7-15. Morgan Kaufmann, 2001.
4. E. Amir and S. McIlraith. Partition-based logical reasoning. In Proc. 7th Int'l Conference on Principles of Knowledge Representation and Reasoning, pages 389-400. Morgan Kaufmann, 2000.
5. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Inform. Process. Lett., 42(3): 153-159, 1992.
6. R. Diestel. Graph theory. Springer-Verlag, New York, second edition, 2000.
7. S. Even. Graph algorithms. Computer Science Press Inc., 1979.
8. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM J. Comput., 31(4):1090-1118, 2002.
9. N. Garg, H. Saran, and V. V. Vazirani. Finding separator cuts in planar graphs within twice the optimal. SIAM J. Comput., 29(1): 159-179, 1999.
10. R. M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23:309-311, 1978.
11. P. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In 25th Annual ACM Symposium on Theory of Computing, pages 682-690, May 1993.
12. S. L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Statistical Society B, 50(2): 157-224, 1988.
13. F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422-431, October 1988.
14. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
15. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2): 177-189, 1979.
16. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44(1):1-29, 1997.
17. B. Mohar. Isoperimetric numbers of graphs. J. Combin. Theory Ser. B, 47(3):274-291, 1989.
18. J. K. Park and C. A. Phillips. Finding minimum-quotient cuts in planar graphs. In 25th Annual ACM Symposium on Theory of Computing, pages 766-775, May 1993.
19. S. Rao. Finding near optimal separators in planar graphs. In 28th Annual Symposium on Foundations of Computer Science, pages 225-237. IEEE, 1987.
20. S. Rao. Faster algorithms for finding small edge cuts in planar graphs. In 24th ACM Symp. on Theory of Computing, pages 229-240. ACM, 1992.
21. N. Robertson and P. D. Seymour. Graph minors. II: algorithmic aspects of treewidth. J. Algorithms, 7:309-322, 1986.
22. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217-241, 1994.
23. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
24. D.B. Shmoys. Cut problems and their applications to divide-and-conquer. In D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
25. D. A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In 37th Annual Symposium on Foundations of Computer Science, pages 96-105. IEEE, 1996.