Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Nili Guttmann-Beck / rank | |||
Property / author | |||
Property / author: Samir Khuller / rank | |||
Property / author | |||
Property / author: Balaji Raghavachari / rank | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21: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