
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

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
We consider ILPs, where each variable corresponds to an integral point w...
read it

Maximizing Determinants under Matroid Constraints
Given vectors v_1,…,v_n∈ℝ^d and a matroid M=([n],I), we study the proble...
read it

Simplex based Steiner tree instances yield large integrality gaps for the bidirected cut relaxation
The bidirected cut relaxation is the characteristic representative of th...
read it

Towards improving Christofides algorithm for halfinteger TSP
We study the traveling salesman problem (TSP) in the case when the objec...
read it

Constant Approximation for kMedian and kMeans with Outliers via Iterative Rounding
In this paper, we present a novel iterative rounding framework for many ...
read it

An Optimal Rounding for HalfIntegral Weighted Minimum Strongly Connected Spanning Subgraph
In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
read it
An Improved Approximation Algorithm for TSP in the Half Integral Case
We design a 1.49993approximation algorithm for the metric traveling salesperson problem (TSP) for instances in which an optimal solution to the subtour linear programming relaxation is halfintegral. These instances received significant attention over the last decade due to a conjecture of Schalekamp, Williamson and van Zuylen stating that halfintegral LP solutions have the largest integrality gap over all fractional solutions. So, if the conjecture of Schalekamp et al. holds true, our result shows that the integrality gap of the subtour polytope is bounded away from 3/2.
READ FULL TEXT
Comments
There are no comments yet.