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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 78; no. 4; pp. 1109 - 1130
Main Authors:	Genova, Kyle, Williamson, David P.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2017 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!