A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights.
Philip N. KleinPublished in: SIAM J. Comput. (2008)
Keyphrases
- weighted graph
- planar graphs
- edge weights
- satisfy the triangle inequality
- minimum weight
- undirected graph
- directed graph
- bipartite graph
- approximation algorithms
- traveling salesman problem
- spanning tree
- shortest path
- minimum spanning tree
- np hard
- data objects
- closed form
- objective function
- graph structure
- minimum cost
- information extraction
- special case
- optimal solution