Approximation algorithms
Relations between average case complexity and approximation complexity
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
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Given a tree Twith costs on edges and a collection ofterminal sets X= {S1, S2, ..., Sl}, thegeneralized Multicut problem asks to find a set of edges onTwhose removal cuts every terminal set in X,such that the total cost of the edges is minimized. The standardversion of the problem can be approximately solved by reducing itto the classical Multicut on trees problem. For theprize-collecting version of the problem, we give a primal-dual3-approximation algorithm and a randomized 2.55-approximationalgorithm (the latter can be derandomized). For thek-version of the problem, we show an interesting relationbetween the problem and the Densest k-Subgraph problem,implying that approximating the k-version of the problemwithin O(n1/6 - ε)for some small ε 0 is hard. We also give a min{ 2(l- k+ 1), k}-approximationalgorithm for the k-version of the problem via anonuniform approach.