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

ALGORITHMS - ESA 2015, pp. 570.0-581.0, 2015.

Cited by: 0|Views8

Abstract:

Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant on the wellknown 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 relaxation of the TSP, and running Christofi...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments