Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Towards Improving Christofides Algorithm on Fundamental Classes by Gluing Convex Combinations of Tours (Journal Version)

Arash Haddadan 1 Alantha Newman 2
2 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : We present a new approach for gluing tours over certain tight, 3-edge cuts. Gluing over 3-edge cuts has been used in algorithms for finding Hamilton cycles in special graph classes and in proving bounds for 2-edge-connected subgraph problem, but not much was known in this direction for gluing connected multigraphs. We apply this approach to the traveling salesman problem (TSP) in the case when the objective function of the subtour elimination relaxation is minimized by a θ-cyclic point: x e ∈ {0, θ, 1 − θ, 1}, where the support graph is subcubic and each vertex is incident to at least one edge with x-value 1. Such points are sufficient to resolve TSP in general. For these points, we construct a convex combination of tours in which we can reduce the usage of edges with x-value 1 from the 3 2 of Christofides algorithm to 3 2 − θ 10 while keeping the usage of edges with fractional x-value the same as Christofides algorithm. A direct consequence of this result is for the Uniform Cover Problem for TSP: In the case when the objective function of the subtour elimination relaxation is minimized by a 2 3-uniform point: x e ∈ {0, 2 3 }, we give a 17 12-approximation algorithm for TSP. For such points, this lands us halfway between the approximation ratios of 3 2 of Christofides algorithm and 4 3 implied by the famous "four-thirds conjecture".
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03101691
Contributor : Alantha Newman Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2021 - 11:37:56 AM
Last modification on : Wednesday, February 3, 2021 - 11:05:22 AM

File

1907.02120.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03101691, version 1

Collections

Citation

Arash Haddadan, Alantha Newman. Towards Improving Christofides Algorithm on Fundamental Classes by Gluing Convex Combinations of Tours (Journal Version). 2021. ⟨hal-03101691⟩

Share

Metrics

Record views

64

Files downloads

37