Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004530010045 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043916130 / rank | |||
Normal rank | |||
Revision as of 20:52, 19 March 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
