DeepAI AI Chat
Log In Sign Up

Matroid-Based TSP Rounding for Half-Integral Solutions

by   Anupam Gupta, et al.

We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on sampling from max-entropy distributions. We build on an approach of Haddadan and Newman to show how sampling from the matroid intersection polytope, and a new use of max-entropy sampling, can give better guarantees.


page 1

page 2

page 3

page 4


An Improved Approximation Algorithm for TSP in the Half Integral Case

We design a 1.49993-approximation algorithm for the metric traveling sal...

Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow

Given an edge weighted graph and a forest F, the 2-edge connectivity aug...

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

Sommerfeld type integrals for discrete diffraction problems

Three discrete problems for Helmholtz equation is studied analytically u...

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

In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...