Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
type: Item
instance of: scholarly article
title: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
zbMATH Open document ID: 0963.68226
author: Refael Hassin
author: Nili Guttmann-Beck
author: Samir Khuller
author: Balaji Raghavachari
published in: Algorithmica
publication date: 2000-11-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1530295
zbMATH Keywords: undirected graph
zbMATH Keywords: clustered traveling salesman problem
zbMATH Keywords: shortest Hamiltonian cycle
MaRDI profile type: Publication
full work available at URL: s004530010045
OpenAlex ID: W2043916130
DOI: 10.1007/S004530010045
Recommended article: Q4247262
Recommended article: A note on approximation algorithms of the clustered traveling salesman problem
Recommended article: An improved approximation algorithm for the clustered traveling salesman problem
Recommended article: An approximation algorithm for the clustered path travelling salesman problem
Recommended article: Q5133137
Recommended article: An exact algorithm for the clustered travelling salesman problem
Recommended article: Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
Recommended article: Approximation Algorithms for Not Necessarily Disjoint Clustered TSP
Recommended article: Some applications of the clustered travelling salesman problem
description: scientific article; zbMATH DE number 1530295