Integer and combinatorial optimization
Integer and combinatorial optimization
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation Algorithms for Single-Source Unsplittable Flow
SIAM Journal on Computing
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Instant Recognition of Half Integrality and 2-Approximations
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for partial covering problems
Journal of Algorithms
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Rounding to an integral program
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Theoretical Computer Science
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating Generalized Multicut on Trees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
An approximation algorithm for the Generalized k-Multicut problem
Discrete Applied Mathematics
Theoretical Computer Science
| Hi-index | 0.00 |
We study the k-multicut problem: Given an edge-weighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the k-multicut problem on trees can be approximated within a factor of 8/3 + ε, for any fixed ε 0, and within O(log2 n log log n) on general graphs, where n is the number of vertices in the graph.For any fixed ε 0, we also obtain a polynomial time algorithm for k-multicut on trees which returns a solution of cost at most (2 + ε) · OPT, that separates at least (1 - ε) · k pairs, where OPT is the cost of the optimal solution separating k pairs.Our techniques also give a simple 2-approximation algorithm for the multicut problem on trees using total unimodularity, matching the best known algorithm [8].