An improved parameterized algorithm for the minimum node multiway cut problem

Algorithmica (New York)

Volumn 55, Issue 1, 2009, Pages 1-13

  Chen, Jianer ^a   Liu, Yang ^a   Lu, Songjian ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Fixed parameter tractability; Minimum cut; Multiway cut problem; Network flow; Parameterized algorithm

Indexed keywords

FIXED-PARAMETER TRACTABILITY; MINIMUM CUT; MULTIWAY CUT PROBLEM; NETWORK FLOW; PARAMETERIZED ALGORITHM;

POLYNOMIAL APPROXIMATION; SEPARATORS;

ALGORITHMS;

EID: 67249162314     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9130-6     Document Type: Article

References (15)

1. Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition, pp. 648-655, 1998
2. G. Calinescu H. Karloff Y. Rabani 2000 An improved approximation algorithm for multiway cut J. Comput. Syst. Sci. 60 564 574
3. Chartrand, G., Lesniak, L.: Graphs & Digraphs, 2nd edn. Wadsworth/Cole Mathematics Series, Belmont (1986)
4. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. Manuscript (2007)
5. Cong, J., Labio, W., Shivakumar, N.: Multi-way VLSI circuit partitioning based on dual net representation. In: Proc. IEEE International Conference on Computer-Aided Design, pp. 56-62, 1994
6. W. Cunningham 1991 The optimal multiterminal cut problem DIMACS Ser. Discrete Math. Theor. Comput. Sci. 5 105 120
7. E. Dahlhaus D. Johnson C. Papadimitriou P. Seymour M. Yannakakis 1994 The complexity of multiterminal cuts SIAM J. Comput. 23 864 894
8. R. Downey M. Fellows 1995 Fixed-parameter tractability and completeness I: basic results SIAM J. Comput. 24 873 921
9. Downey, R., Fellows, M.: Parameterized Complexity. Monograph in Computer Science. Springer, New York (1999)
10. Ford, L. Jr., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
11. Karger, D., Levine, M.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: Proc. 30th Annual ACM Symposium on Theory of Computing, pp. 69-78, 1998
12. Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: Proc. 31th Annual ACM Symposium on Theory of Computing, pp. 668-678, 1999
13. D. Marx 2006 Parameterized graph separation problems Theor. Comput. Sci. 351 394 406 (Pubitemid 43207633)
14. J. Naor L. Zosin 2001 A 2-approximation algorithm for the directed multiway cut problem SIAM J. Comput. 31 477 482 (Pubitemid 33782961)
15. H. Stone 1977 Multiprocessor scheduling with the aid of network flow algorithms IEEE Trans. Softw. Eng. 3 85 93