Login / Signup
Improved approximations for ordered TSP on near-metric graphs.
Hans-Joachim Böckenhauer
Monika Steinová
Published in:
RAIRO Theor. Informatics Appl. (2014)
Keyphrases
</>
traveling salesman problem
maximum common subgraph
error metrics
graph theory
optimal solution
directed graph
graph theoretic
distance measure
ant colony optimization
closed form
combinatorial optimization
graph structure