Approximation algorithms for not necessarily disjoint clustered TSP (Q4554892)
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 6976286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for not necessarily disjoint clustered TSP |
scientific article; zbMATH DE number 6976286 |
Statements
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (English)
0 references
12 November 2018
0 references
shortest Hamiltonian path
0 references
clustered traveling salesman problem
0 references
0 references
0 references
0 references
0.8817999958992004
0 references
0.8790936470031738
0 references
0.8660891056060791
0 references
0.8604802489280701
0 references
