Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

European Journal of Operational Research

Volumn 186, Issue 2, 2008, Pages 542-553

  Guo, Jiong ^a   Hüffner, Falk ^a   Kenar, Erhan ^b   Niedermeier, Rolf ^a   Uhlmann, Johannes ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Combinatorial optimization; Complexity theory; Dynamic programming; Graph theory; NP completeness; Parameterized complexity

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

COMPLEXITY THEORY; NP-COMPLETENESS; PARAMETERIZED COMPLEXITY; TERMINAL VERTICES;

TELECOMMUNICATION NETWORKS;

EID: 35349016809     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.02.014     Document Type: Article

References (32)

1. C. Bentz, Edge disjoint paths and multicut problems in graphs generalizing the trees. Technical Report 948, CNAM-Laboratoire Cédric, Paris, 2005.
2. H.L. Bodlaender, Treewidth: Algorithmic techniques and results, in: Proceedings of 22nd MFCS, vol. 1295, Lecture Notes in Computer Science, Springer, 1997, pp. 19-36.
3. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209 (1998) 1-45
4. H.L. Bodlaender, Treewidth: Characterizations, applications, and computations, in: Proceedings of 32nd WG, vol. 4271, Lecture Notes in Computer Science, Springer, 2006, pp. 1-14.
5. Booth K.S., and Lueker G.S. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13 3 (1976) 335-379
6. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
7. R.D. Carr, S. Doddi, G. Konjevod, M.V. Marathe, On the red-blue set cover problem, in: Proceedings of 11th SODA, ACM/SIAM, 2000, pp. 345-353.
8. Costa M., Létocart L., and Roupin F. Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research 162 1 (2005) 55-69
9. Cǎlinescu G., Fernandes C.G., and Reed B. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms 48 2 (2003) 333-359
10. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., and Yannakakis M. The complexity of multiterminal cuts. SIAM Journal on Computing 23 4 (1994) 864-894
11. Dinic E.A. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady 11 (1970) 1277-1280
12. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
13. Erdo{combining double acute accent}s P.L., and Székely L.A. Evolutionary trees: An integer multicommodity max-flow-min-cut theorem. Advances in Applied Mathematics 13 4 (1992) 375-389
14. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
16. Garg N., Vazirani V., and Yannakakis M. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 1 (1997) 3-20
17. Garg N., Vazirani V., and Yannakakis M. Multiway cuts in node weighted graphs. Journal of Algorithms 50 1 (2004) 49-61
18. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press
19. Guo J., Hüffner F., Kenar E., Niedermeier R., and Uhlmann J. Complexity and exact algorithms for Multicut. Proceedings of 32nd SOFSEM. Lecture Notes in Computer Science vol. 3831 (2006), Springer 137-147
20. Guo J., and Niedermeier R. Fixed-parameter tractability and data reduction for multicut in trees. Networks 46 3 (2005) 124-135
21. Guo J., and Niedermeier R. Exact algorithms and applications for tree-like weighted set cover. Journal of Discrete Algorithms 4 4 (2006) 608-622
22. Hu T.C. Multicommodity networks flow. Operations Research 9 (1963) 898-900
23. Itai A. Two-commodity flow. Journal of the ACM 25 (1978) 596-611
24. Kenar E., and Uhlmann J. Multicut in graphs. Student research project, WSI für Informatik (2005), Universität Tübingen, Germany
25. Kloks T. Treewidth: Computations and Approximations. Lecture Notes in Computer Science vol. 842 (1994), Springer
26. Marx D. Parameterized graph separation problems. Theoretical Computer Science 351 3 (2006) 394-406
27. McKee T.A., and McMorris F.R. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications (1999), SIAM
28. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley
29. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
30. Reed B.A. Algorithmic aspects of tree width. In: Reed B.A., and Sales C.L. (Eds). Recent Advances in Algorithms and Combinatorics (2003), Springer 85-107
31. Robertson N., and Seymour P.D. Graph minors. II: Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
32. Telle J.A., and Proskurowski A. Practical algorithms on partial k-trees with an application to domination-like problems. Proceedings of 3rd WADS. Lecture Notes in Computer Science vol. 709 (1993), Springer 610-621