Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs.

Amariah Becker Eli Fox-Epstein Philip N. Klein David Meierfrankenfeld

Published in: SEA (2017)

Keyphrases

traveling salesman
planar graphs
polynomial time approximation
traveling salesman problem
evolutionary algorithm
quadratic assignment problem
computational complexity
lower bound
closed form
approximation algorithms
minimum weight