Towards Improving Christofides Algorithm on Fundamental Classes by Gluing Convex Combinations of Tours

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-03
Hauptverfasser:	Haddadan, Arash, Newman, Alantha
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Integers Linear programming Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!