An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem

Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known Christofides’ algorithm for the TSP, called the Best-of-Many Christofides’ algorithm . The algorithm involves sampling a spanning tree from the solution to the standard LP re...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 78; číslo 4; s. 1109 - 1130
Hlavní autori:	Genova, Kyle, Williamson, David P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2017 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Computing costs Cost engineering Data Structures and Information Theory Graph theory Mathematics of Computing Maximum entropy Sampling Theory of Computation Traveling salesman problem Christofides’ algorithm Traveling salesman problem Approximation algorithms Maximum entropy
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!