Approximation Algorithms for Not Necessarily Disjoint Clustered TSP

From MaRDI portal
Publication:4554892

DOI10.7155/jgaa.00478zbMath1400.05238OpenAlexW2899200421WikidataQ128974684 ScholiaQ128974684MaRDI QIDQ4554892

Eyal Knaan, Nili Guttmann-Beck, Michal Stern

Publication date: 12 November 2018

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00478




Related Items (1)




Cites Work




This page was built for publication: Approximation Algorithms for Not Necessarily Disjoint Clustered TSP