Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
From MaRDI portal
Publication:5432314
DOI10.1007/978-3-540-72845-0_11zbMath1203.90132MaRDI 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
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Approximating the Metric TSP in Linear Time, Computing compatible tours for the symmetric traveling salesman problem, Approximating the metric TSP in linear time, Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Uses Software