The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme |
scientific article; zbMATH DE number 6621964
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme |
scientific article; zbMATH DE number 6621964 |
Statements
2 September 2016
0 references
traveling salesman
0 references
approximation algorithm
0 references
hierarchies
0 references
0 references
0 references
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (English)
0 references
