Packing multiway cuts in capacitated graphs
Siddharth Barman, Shuchi Chawla

TL;DR
This paper introduces the first constant-factor approximation algorithm for the multiway cut packing problem in general graphs, improving upon previous logarithmic approximations by leveraging laminar solutions.
Contribution
It presents a novel constant-factor approximation algorithm for multiway cut packing in arbitrary undirected graphs, utilizing laminar solutions to simplify the problem.
Findings
Achieved a constant-factor approximation for the problem.
Demonstrated the existence of near-optimal laminar solutions.
Improved approximation bounds over previous logarithmic algorithms.
Abstract
We consider the following "multiway cut packing" problem in undirected graphs: we are 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 {E_1,...,E_k} such that E_i 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 crossing 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, informally, the goal is to complete the labeling in the most consistent way. This problem was introduced by Rabani,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · VLSI and FPGA Design Techniques · Complexity and Algorithms in Graphs
