An improved approximation algorithm for the clustered traveling salesman problem
From MaRDI portal
Publication:456175
DOI10.1016/j.ipl.2012.08.020zbMath1248.68551MaRDI QIDQ456175
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.020
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
On the clustered Steiner tree problem, On the minimum routing cost clustered tree problem, A note on approximation algorithms of the clustered traveling salesman problem, Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem, On the Clustered Steiner Tree Problem
Cites Work