Complexity and exact algorithms for multicut

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

Volumn 3831 LNCS, Issue , 2006, Pages 303-312

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

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; ROUGH SET THEORY; TREES (MATHEMATICS);

BOUNDED TREEWIDTH; INTERVAL GRAPHS; RESTRICTED CLASSES; TERMINAL VERTICES;

COMPUTATIONAL COMPLEXITY;

EID: 33745650658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11611257_28     Document Type: Conference Paper

References (10)

1. 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 (1976) 335-379
2. Costa, M., Létocart, L., and Roupin, P.: Minimal Multicut and Maximal Integer Multiflow: a Survey. European Journal of Operational Research 162 1 (2005) 55-69
3. 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 (2003) 333-359
4. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., and Yannakakis, M.: The Complexity of Multiterminal Cuts. SI AM Journal on Computing 23 4 (1994) 864-894
5. Erdös, P.L., and Székely, L.A: Evolutionary Trees: an Integer Multicommodity Max-Flow-Min-Cut Theorem. Advances in Applied Mathematics 13 (1992) 375389
6. Garg, N., Vazirani, V., and Yannakakis, M.: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica 18 1 (1997) 3-20
7. Guo, J., and Niedermeier, R.: Exact Algorithms and Applications for Tree- Like Weighted Set Cover. To appear in Journal of Discrete Algorithms (2005)
8. Guo, J., and Niedermeier, R.: Fixed-Parameter Tractability and Data Reduction for Multicut in Trees. Networks 46 3 (2005) 124-135
9. Marx, D.:. Parameterized Graph Separation Problems. In Proc. 1st IWPEC, LNCS, Springer 3162 (2004) pages 71-82 Long version to appear in Theoretical Computer Science.
10. Veinott, A.F., and Wagner, H.M.: Optimal Capacity Scheduling. Operations Research 10 (1962) 518-532