DeepAI AI Chat
Log In Sign Up

LP Relaxation and Tree Packing for Minimum k-cuts

by   Chandra Chekuri, et al.
University of Illinois at Urbana-Champaign
Oath Inc.

Karger used spanning tree packings to derive a near linear-time randomized algorithm for the global minimum cut problem as well as a bound on the number of approximate minimum cuts. This is a different approach from his well-known random contraction algorithm. Thorup developed a fast deterministic algorithm for the minimum k-cut problem via greedy recursive tree packings. In this paper we revisit properties of an LP relaxation for k-cut proposed by Naor and Rabani, and analyzed by Chekuri, Guha and Naor. We show that the dual of the LP yields a tree packing, that when combined with an upper bound on the integrality gap for the LP, easily and transparently extends Karger's analysis for mincut to the k-cut problem. In addition to the simplicity of the algorithm and its analysis, this allows us to improve the running time of Thorup's algorithm by a factor of n. We also improve the bound on the number of α-approximate k-cuts. Second, we give a simple proof that the integrality gap of the LP is 2(1-1/n). Third, we show that an optimum solution to the LP relaxation, for all values of k, is fully determined by the principal sequence of partitions of the input graph. This allows us to relate the LP relaxation to the Lagrangian relaxation approach of Barahona and Ravi and Sinha; it also shows that the idealized recursive tree packing considered by Thorup gives an optimum dual solution to the LP. This work arose from an effort to understand and simplify the results of Thorup.


page 1

page 2

page 3

page 4


A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

The Matching Augmentation Problem (MAP) has recently received significan...

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP

We introduce multiple symmetric LP relaxations for minimum cut problems....

Fast Approximations for Metric-TSP via Linear Programming

We develop faster approximation algorithms for Metric-TSP building on re...

Approximate Multi-Matroid Intersection via Iterative Refinement

We introduce a new iterative rounding technique to round a point in a ma...

The Number of Minimum k-Cuts: Improving the Karger-Stein Bound

Given an edge-weighted graph, how many minimum k-cuts can it have? This ...

Beyond the Quadratic Time Barrier for Network Unreliability

Karger (STOC 1995) gave the first FPTAS for the network (un)reliability ...