Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892)
From MaRDI portal
scientific article; zbMATH DE number 6976286
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
