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

05/20/2021
by   Anna Karlin, et al.
0

We show that for some ϵ > 10^-36 and any metric TSP instance, the max entropy algorithm returns a solution of expected cost at most 3/2-ϵ times the cost of the optimal solution to the subtour elimination LP. This implies that the integrality gap of the subtour LP is at most 3/2-ϵ. This analysis also shows that there is a randomized 3/2-ϵ approximation for the 2-edge-connected multi-subgraph problem, improving upon Christofides' algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2019

Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem

We consider the integrality gap of the subtour LP relaxation of the Trav...
research
06/15/2023

FLAIR: A Metric for Liquidity Provider Competitiveness in Automated Market Makers

This paper aims to enhance the understanding of liquidity provider (LP) ...
research
12/13/2022

A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP

We show that the max entropy algorithm can be derandomized (with respect...
research
11/15/2017

A Friendly Smoothed Analysis of the Simplex Method

Explaining the excellent practical performance of the simplex method for...
research
11/11/2020

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

In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
research
08/07/2020

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...
research
07/10/2018

A note on the integrality gap of the configuration LP for restricted Santa Claus

In the restricted Santa Claus problem we are given resources R and play...

Please sign up or login with your details

Forgot password? Click here to reset