On Approximation Hardness of Dense TSP and other Path Problems

Wenceslas Fernandez de la Vega Marek Karpinski

Published in: Electron. Colloquium Comput. Complex. (1998)

Keyphrases

optimization problems
traveling salesman problem
np complete
shortest path
combinatorial optimization
problems involving
data sets
computational complexity
solving problems
shortest path problem
path finding
computational problems