Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592)
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: Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters |
scientific article; zbMATH DE number 7166066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters |
scientific article; zbMATH DE number 7166066 |
Statements
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (English)
0 references
11 February 2020
0 references
generalized traveling salesman problem
0 references
polynomial-time approximation scheme
0 references
polynomial-time solvable subclass
0 references
0 references
0 references
0 references
0 references
0 references
0.872469425201416
0 references
0.7848302125930786
0 references
0.7731630802154541
0 references
0.7637569904327393
0 references
0.7617979049682617
0 references
