Multicut algorithms via tree decompositions

Authors:
Reinhard Pichler;Stefan Rümmele;Stefan Woltran
Affiliations:
Vienna University of Technology;Vienna University of Technology;Vienna University of Technology
Venue:
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Year:
2010

Citing 13
Cited 1

Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
Safe Reduction Rules for Weighted Treewidth

Algorithmica
A logical approach to multicut problems

Information Processing Letters
On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Discrete Applied Mathematics
Note: A simple algorithm for multicuts in planar graphs with outer terminals

Discrete Applied Mathematics
Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Combinatorial Optimization on Graphs of Bounded Treewidth

The Computer Journal

Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identified which lead to fixed-parameter tractability (FPT). Recently, Gottlob and Lee have proposed the treewidth of the structure representing the graph and the set of pairs of terminal vertices as one such parameter. In this work, we show how this theoretical FPT result can be turned into efficient algorithms for optimization, counting, and enumeration problems in this area.