Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Nili Guttmann-Beck / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Samir Khuller / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Balaji Raghavachari / rank | |||
Normal rank | |||
Revision as of 17:32, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem |
scientific article |
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
