Packing multiway cuts in capacitated graphs
نویسندگان
چکیده
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(logn/ log logn) approximation for it in general graphs, as well as an improved O(log 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.
منابع مشابه
Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs
We propose a new algorithm for practically feasible exhaustive generation of small multiway cuts in sparse graphs. The purpose of the algorithm is to support a complete analysis of critical combinations of road disruptions in real-world road networks. Our algorithm elaborates on a simple underlying idea from matroid theory – that a circuit-cocircuit intersection cannot have cardinality one (her...
متن کاملFlow equivalent trees in undirected node-edge-capacitated planar graphs
Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...
متن کاملOn the Complexity of Some Enumeration Problems for Matroids
Let M be a matroid defined by an independence oracle on ground set S, and let A ⊆ S. We present an incremental polynomial-time algorithm for enumerating all minimal (maximal) subsets of S which span (do not span) A. Special cases of these problems include the generation of bases, circuits, hyperplanes, flats of given rank, circuits through a given element, generalized Steiner trees and multiway...
متن کاملComputing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected components. We present an algorithm for this problem which runs in strongly polynomial-time if both the specified number of connected components and the maximum size of hyperedges in the hypergraph are constants. Our algorithm...
متن کامل