Algorithms for multiterminal cuts

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

Volumn 5010 LNCS, Issue , 2008, Pages 314-325

  Xiao, Mingyu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Fixed Parameter Tractability; Graph Algorithm; Multicut; Multiterminal Cut

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

FIXED PARAMETER TRACTABILITY; GRAPH ALGORITHM; MULTICUT; MULTITERMINAL CUT;

GRAPH THEORY;

EID: 44649191818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_32     Document Type: Conference Paper

References (18)

1. Calinescu, G., Fernandes, C., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2), 333-359 (2003)
2. Calinescu, G., Karloff, H.J., Rabani, Y.: An improved approximation algorithm for multiway cut. Journal of Computer and Systems Sciences 60(3), 564-574 (2000); a preliminary version appeared in STOC 1998 (1998)
3. Chen, J., Liu, Y., Lu, S.: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, Springer, Heidelberg (2007)
4. Costa, M.-C., Létocart, L., Roupin, F.: Minimal multicut and maximal integer multifiow: A survey. European Journal of Operational Research 162(1), 55-69 (2005)
5. Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864-894 (1994)
6. Dinic, E.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11, 1277-1280 (1970)
7. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Feige, U., Mahdian, M.: Finding small balanced separators. In: Proceedings of the 38th Annual ACM symposium on Theory of Computing (STOC 2006) (2006)
9. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. J. Algorithms 50(1), 49-61 (2004)
10. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783-797 (1998)
11. Goldschmidt, O., Hochbaum, D.: A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research 19(1), 24-37 (1994)
12. Guo, J., Huffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for multicut. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831. Springer, Heidelberg (2006)
13. Ford, J.R., Fullkerson, D.R.: Flows in networks. Princeton University Press, Princeton (1962)
14. Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding relaxation of minimum multiway cut. In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC 1999) (1999)
15. Marx, D.: The closest substring problem with small distances. In: Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005) (2005)
16. Marx, D.: Parameterized graph separation problems. Theoret. Comput. Sci. 351(3), 394-406 (2006)
17. Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput. 31(2), 477-482 (2001)
18. Yeh, W.-C.: A simple algorithm for the planar multiway cut problem. J. Algorithms 39(1), 68-77 (2001)