Multicut algorithms via tree decompositions

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

Volumn 6078 LNCS, Issue , 2010, Pages 167-179

  Pichler, Reinhard ^a   Rümmele, Stefan ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; FIXED-PARAMETER TRACTABILITY; MULTICUTS; NETWORK DESIGN; TERMINAL VERTICES; TREE DECOMPOSITION; TREE-WIDTH; ENUMERATION PROBLEMS;

GRAPH THEORY; COMPLEX NETWORKS; OPTIMIZATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 77953757645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13073-1_16     Document Type: Conference Paper

References (20)

1. Costa, M.C., Ĺetocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research 162, 55-69 (2005)
2. Cälinescu, G., Fernandes, C.G., Reed, B.A.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Alg. 48, 333-359 (2003)
3. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864-894 (1994)
4. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3-20 (1997)
5. Bentz, C.: A simple algorithm for multicuts in planar graphs with outer terminals. Discrete Applied Mathematics 157, 1959-1964 (2009)
6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
7. Bousquet, N., Daligault, J., Thomasśe, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Proc. STACS 2009. LIPIcs, vol.3, pp. 183-194 (2009)
8. Marx, D., Razgon, I.: Constant ratio fixed-parameter approximation of the edge multicut problem. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.5757, pp. 647-658. Springer, Heidelberg (2009)
9. Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351, 394-406 (2006)
10. Xiao, M.: Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. (to appear, 2010)
11. Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research 186, 542-553 (2008)
12. Bentz, C.: On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics 156, 1908-1917 (2008)
13. Gottlob, G., Lee, S.T.: A logical approach to multicut problems. Inf. Process. Lett. 103, 136-141 (2007)
14. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theor. Comp. Sci., vol.B, pp. 193-242. Elsevier Science Publishers, Amsterdam (1990)
15. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991)
16. Pichler, R., Rümmele, S.,Woltran, S.: Multicut algorithms via tree decompositions. Technical Report DBAI-TR-2010-2067, Technische Universität Wien (2010)
17. Kloks, T.: Treewidth: Computations and Approximations. Springer, Berlin (1994)
18. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
19. van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica 47, 139-158 (2007)
20. Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51, 255-269 (2008)