Constant ratio fixed-parameter approximation of the edge multicut problem

Authors:
Dániel Marx;Igor Razgon
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary;Cork Constraint Computation Centre, University College Cork, Ireland
Venue:
Information Processing Letters
Year:
2009

Citing 17
Cited 8

On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

SIAM Journal on Computing
Correlation Clustering

Machine Learning
Fixed-parameter tractability and data reduction for multicut in trees

Networks
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
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Computational Complexity
Correlation clustering in general weighted graphs

Theoretical Computer Science - Approximation and online algorithms
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Algorithms for multiterminal cuts

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Greedy localization and color-coding: improved matching and packing algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter approximation: conceptual framework and approximability results

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On parameterized approximability

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity and Approximation Algorithms

The Computer Journal

On the parameterized complexity of some optimization problems related to multiple-interval graphs

Theoretical Computer Science
Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing
Paths, flowers and vertex cover

ESA'11 Proceedings of the 19th European conference on Algorithms
Restricted vertex multicut on permutation graphs

Discrete Applied Mathematics
Parameterized approximation via fidelity preserving transformations

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Completely inapproximable monotone and antimonotone parameterized problems

Journal of Computer and System Sciences
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.89

Visualization

Abstract

The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s"1,t"1},...,{s"m,t"m}; the task is to remove a minimum set of edges such that s"i and t"i are disconnected for every 1=