DeepAI AI Chat
Log In Sign Up

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP

by   Robert D. Carr, et al.

We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that this leads to one of two interesting results. In one case, these LPs always give optimal and near optimal solutions, and then they would be the smallest known symmetric LPs for the problems considered. Otherwise, these LP formulations give strictly better LP relaxations for the traveling salesperson problem than the subtour relaxation. We have the smallest known LP formulation that is a 9/8-approximation or better for min-cut. In addition, the LP relaxation of min-cut investigated in this paper has interesting constraints; the LP contains only a single typical min-cut constraint and all other constraints are typically only used for max-cut relaxations.


page 1

page 2

page 3

page 4


LP Relaxation and Tree Packing for Minimum k-cuts

Karger used spanning tree packings to derive a near linear-time randomiz...

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

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

Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory

We revisit Min-Mean-Cycle, the classical problem of finding a cycle in a...

Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs

We study the approximability of a recently introduced framework for clus...

Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem

The distribution of the computational cost of linear-programming (LP) re...

A scaleable projection-based branch-and-cut algorithm for the p-center problem

The p-center problem (pCP) is a fundamental problem in location science,...

Downgrading to Minimize Connectivity

We study the problem of interdicting a directed graph by deleting nodes ...