Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1713-1725

  Chitnis, Rajesh ^a   Hajiaghayi, MohammadTaghi ^a   Marx, Dániel ^b,c  

^a Institute of Advanced Computer Science   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZATION;

DIRECTED EDGES; FIXED-PARAMETER TRACTABILITY; K TERMINALS; MULTIWAY CUT; MULTIWAY CUT PROBLEMS; NATURAL GENERALIZATION; PARAMETERIZED; UNDIRECTED GRAPH;

DIRECTED GRAPHS;

EID: 84860189124     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.136     Document Type: Conference Paper

References (18)

1. N. Bousquet, J. Daligault, and S. Thomassé. Multicut is FPT. In STOC, pages 459-468, 2011.
2. J. Chen, Y. Liu, and S. Lu. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica, 55(1):1-13, 2009.
3. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5), 2008.
4. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis. The complexity of multiway cuts. In STOC, 1992. pages 241-251.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999. 530 pp.
6. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006. 493 pp.
7. L. Ford and D. Fulkerson. Maximal flow through a network. Canad. J. Math., 8:399-404, 1956.
8. N. Garg, V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In ICALP, 1994. pages 487-498.
9. S. Guillemot. FPT algorithms for path-transversal and cycle-transversal problems. Discrete Optimization, 8(1):61-71, 2011.
10. D. Karger, P. Klein, C. Stein, M. Thorup, and N. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. In STOC, 1999. pages 668-678.
11. D. Lokshtanov and D. Marx. Clustering with local restrictions. In ICALP (1), pages 785-797, 2011.
12. D. Marx. Parameterized graph separation problems. Theor. Comput. Sci., 351(3):394-406, 2006. (Pubitemid 43207633)
13. D. Marx and I. Razgon. Fixed-parameter tractability of multicut parameterized by the size of the cutset. In STOC, pages 469-478, 2011.
14. J. Naor, L. Schulman, and A. Srinivasan. Splitters and near-optimal derandomization. In FOCS, 1995. pages 182-191.
15. J. Naor and L. Zosin. A 2-approximation algorithm for the directed multiway cut problem. In FOCS, 1997. pages 548-553.
16. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006. 312 pp.
17. I. Razgon and B. O'Sullivan. Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci., 75(8):435-450, 2009.
18. M. Xiao. Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst., 46(4):723-736, 2010.