Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem |
scientific article; zbMATH DE number 1530295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem |
scientific article; zbMATH DE number 1530295 |
Statements
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (English)
0 references
14 November 2000
0 references
undirected graph
0 references
clustered traveling salesman problem
0 references
shortest Hamiltonian cycle
0 references
0.95831954
0 references
0.9565665
0 references
0.95206445
0 references
0.9520644
0 references
0.93290055
0 references
0.9280609
0 references
0.91459304
0 references
