Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Finding the exact integrality gap \(\alpha\) for the LP relaxation of the 2-edge-connected spanning multigraph problem (2EC) is closely related to the same problem for the Held-Karp relaxation of the metric traveling salesman problem (TSP). While the former problem seems easier than the latter, sinc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Haddadan, Arash, Newman, Alantha
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Coloring Graph theory Polynomials Traveling salesman problem Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!