Login / Signup
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP.
Sanjeev Arora
Michelangelo Grigni
David R. Karger
Philip N. Klein
Andrzej Woloszyn
Published in:
SODA (1998)
Keyphrases
</>
polynomial time approximation
np hard
planar graphs
approximation algorithms
error bounds
traveling salesman problem
bin packing
weighted graph
optimal solution
integer programming
optimization problems
special case
scheduling problem
worst case
ant colony optimization
boundary points