DeepAI AI Chat
Log In Sign Up

An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph

by   D. Ellis Hershkowitz, et al.

In the weighted minimum strongly connected spanning subgraph (WMSCSS) problem we must purchase a minimum-cost strongly connected spanning subgraph of a digraph. We show that half-integral linear program (LP) solutions for WMSCSS can be efficiently rounded to integral solutions at a multiplicative 1.5 cost. This rounding matches a known 1.5 integrality gap lower bound for a half-integral instance. More generally, we show that LP solutions whose non-zero entries are at least a value f > 0 can be rounded at a multiplicative cost of 2 - f.


page 1

page 2

page 3

page 4


A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

Given a connected undirected graph G̅ on n vertices, and non-negative ed...

Minimum strongly biconnected spanning directed subgraph problem

Let G=(V,E) be a strongly biconnected directed graph. In this paper we c...

Sparse highly connected spanning subgraphs in dense directed graphs

Mader (1985) proved that every strongly k-connected n-vertex digraph con...

On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

Our motivation is to improve on the best approximation guarantee known f...

A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP

We show that for some ϵ > 10^-36 and any metric TSP instance, the max en...

Matroid-Based TSP Rounding for Half-Integral Solutions

We show how to round any half-integral solution to the subtour-eliminati...

A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP

A long-standing conjecture for the traveling salesman problem (TSP) stat...