Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
From MaRDI portal
Publication:5432314
DOI10.1007/978-3-540-72845-0_11zbMath1203.90132OpenAlexW1559930957MaRDI QIDQ5432314
Vladimir G. Deǐneko, Alexander Tiskin
Publication date: 2 January 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_11
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Approximating the Metric TSP in Linear Time ⋮ Approximating the metric TSP in linear time ⋮ Computing compatible tours for the symmetric traveling salesman problem ⋮ Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Uses Software
This page was built for publication: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
