Login / Signup
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs.
András Sebö
Jens Vygen
Published in:
CoRR (2012)
Keyphrases
</>
data integration
traveling salesman problem
connected subgraphs
data management
databases
combinatorial optimization
directed acyclic graph
biological networks
shortest path
approximation algorithms
ant colony optimization
input image
np hard
statistical analysis
data structure
data mining
data sets