An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph. In this paper, we develop an O ( k 4 k n 3 ) time algorithm for this problem, significantly improving the previous algorithm o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 55; číslo 1; s. 1 - 13
Hlavní autoři: Chen, Jianer, Liu, Yang, Lu, Songjian
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer-Verlag 01.09.2009
Springer
Témata:
Algorithm Analysis and Problem Complexity
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer Science
Computer science; control theory; systems
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Exact sciences and technology
Flows in networks. Combinatorial problems
Information retrieval. Graph
Mathematics of Computing
Operational research and scientific management
Operational research. Management science
Theoretical computing
Theory of Computation
Multiway cut problem
Minimum cut
Parameterized algorithm
Network flow
Fixed-parameter tractability
Graph cut
Graph theory
Polynomial method
Computational complexity
Terminal
Separator
Polynomial time
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph. In this paper, we develop an O ( k 4 k n 3 ) time algorithm for this problem, significantly improving the previous algorithm of time for the problem. Our result gives the first polynomial time algorithm for the minimum node multiway cut problem when the separator size is bounded by O (log  n ).
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-007-9130-6