An improved parameterized algorithm for the minimum node multiway cut problem

Authors:
Jianer Chen;Yang Liu;Songjian Lu
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 11
Cited 12

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Multi-way VLSI circuit partitioning based on dual net representation

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Finding maximum flows in undirected graphs seems easier than bipartite matching

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding algorithms for a geometric embedding of minimum multiway cut

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A 2-Approximation Algorithm for the Directed Multiway Cut Problem

SIAM Journal on Computing
Markov Random Fields with Efficient Approximations

CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
Multiprocessor Scheduling with the Aid of Network Flow Algorithms

IEEE Transactions on Software Engineering
Parameterized Complexity

Parameterized Complexity

A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
FPT algorithms for path-transversals and cycle-transversals problems in graphs

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Algorithms for multiterminal cuts

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Clustering with local restrictions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Important separators and parameterized algorithms

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
What's next? future directions in parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
On the parameterized complexity of finding separators with non-hereditary properties

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Finding small separators in linear time via treewidth reduction

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(4knO(1)) time algorithm for this problem, significantly improving the previous algorithm of time O(4k3nO(1)) for the problem. Our result also gives the first polynomial time algorithm for the MINIMUM NODE MULTIWAY CUT problem when the separator size is bounded by O(log n).