Compacting cuts: a new linear formulation for minimum cut

Authors:
Robert D. Carr;Goran Konjevod;Greg Little;Venkatesh Natarajan;Ojas Parekh
Affiliations:
Sandia National Labs, Albuquerque, NM;Arizona State University, Tempe, AZ;Massachusetts Institute of Technology, Cambridge, MA;Carnegie Mellon University, Pittsburgh, PA;Emory University, Atlanta, GA
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 15
Cited 0

Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
On a theorem of Mader

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
A simple min-cut algorithm

Journal of the ACM (JACM)
Minimum cuts in near-linear time

Journal of the ACM (JACM)
An alternate formulation of the symmetric traveling salesman problem and its properties

Discrete Applied Mathematics
Approximation algorithms

Approximation algorithms
Randomized metarounding

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Proving Integrality Gaps without Knowing the Linear Program

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Compact vs. exponential-size LP relaxations

Operations Research Letters
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a graph (V, E), existing compact linear formulations for the minimum cut problem require Θ(|V||E|) variables and constraints and can be interpreted as a composition of |V|--1 polyhedra for minimum s-t cuts in much the same way as early approaches to finding globally minimum cuts relied on |V|--1 calls to a minimum s-t cut algorithm. We present the first formulation to beat this bound, one that uses O(|V|2) variables and O(|V|3) constraints. An immediate consequence of our result is a compact linear relaxation with O(|V|2) constraints and O(|V|3) variables for enforcing global connectivity constraints. This relaxation is as strong as standard cut-based relaxations and have applications in solving traveling salesman problems by integer programming as well as finding approximate solutions for survivable network design problems using Jain's iterative rounding method. Another application is a polynomial time verifiable certificate of size n for for the NP-complete problem of l1-embeddability of a rational metric on an n-set (as opposed to one of size n2 known previously).