Improved approximation algorithms for tree alignment
Journal of Algorithms
Minimum 0-extensions of graph metrics
European Journal of Combinatorics
Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
On the closest string and substring problems
Journal of the ACM (JACM)
A More Efficient Approximation Scheme for Tree Alignment
SIAM Journal on Computing
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
SIAM Journal on Discrete Mathematics
Approximation algorithms for labeling hierarchical taxonomies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Packing multiway cuts in capacitated graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Packing multiway cuts in capacitated graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
| Hi-index | 0.00 |
We consider the following "multiway cut packing" problem in undirected graphs: given a graph G = (V, E) and k commodities, each corresponding to a set of terminals located at different vertices in the graph, our goal is to produce a collection of cuts {E1, ..., Ek} such that Ei is a multiway cut for commodity i and the maximum load on any edge is minimized. The load on an edge is defined to be the number of cuts in the solution containing the edge. In the capacitated version of the problem the goal is to minimize the maximum relative load on any edge---the ratio of the edge's load to its capacity. Multiway cut packing arises in the context of graph labeling problems where we are given a partial labeling of a set of items and a neighborhood structure over them, and the goal, informally stated, is to complete the labeling in the most consistent way. This problem was introduced by Rabani, Schulman, and Swamy (SODA'08), who developed an O(log n/log log n) approximation for it in general graphs, as well as an improved O(log2 k) approximation in trees. Here n is the number of nodes in the graph. We present the first constant factor approximation for this problem in arbitrary undirected graphs. Our LP-rounding-based algorithm guarantees a maximum edge load of at most 8OPT + 4 in general graphs. Our approach is based on the observation that every instance of the problem admits a laminar solution (that is, no pair of cuts in the solution crosses) that is near-optimal.