
A 4/3Approximation Algorithm for the Minimum 2Edge Connected Multisubgraph Problem in the HalfIntegral Case
Given a connected undirected graph G̅ on n vertices, and nonnegative ed...
read it

Minimum 2vertex strongly biconnected spanning directed subgraph problem
A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
read it

Sparse highly connected spanning subgraphs in dense directed graphs
Mader (1985) proved that every strongly kconnected nvertex digraph con...
read it

On a Partition LP Relaxation for MinCost 2Node Connected Spanning Subgraphs
Our motivation is to improve on the best approximation guarantee known f...
read it

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...
read it

MatroidBased TSP Rounding for HalfIntegral Solutions
We show how to round any halfintegral solution to the subtoureliminati...
read it

Physical ZeroKnowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle
An undirected graph G is known to both the prover P and the verifier V, ...
read it
An Optimal Rounding for HalfIntegral Weighted Minimum Strongly Connected Spanning Subgraph
In the weighted minimum strongly connected spanning subgraph (WMSCSS) problem we must purchase a minimumcost strongly connected spanning subgraph of a digraph. We show that halfintegral 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 halfintegral instance. More generally, we show that LP solutions whose nonzero entries are at least a value f > 0 can be rounded at a multiplicative cost of 2  f.
READ FULL TEXT
Comments
There are no comments yet.