Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7593352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems |
scientific article; zbMATH DE number 7593352 |
Statements
Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (English)
0 references
27 September 2022
0 references
approximation algorithm
0 references
min-max
0 references
traveling salesman problem
0 references
clustered traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0.8816357254981995
0 references
0.8730620741844177
0 references
0.8563815355300903
0 references
