On the complexity of approximating TSP with neighborhoods and related problems (Q853644)
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: On the complexity of approximating TSP with neighborhoods and related problems |
scientific article; zbMATH DE number 5073642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of approximating TSP with neighborhoods and related problems |
scientific article; zbMATH DE number 5073642 |
Statements
On the complexity of approximating TSP with neighborhoods and related problems (English)
0 references
17 November 2006
0 references
NP-optimization problems
0 references
approximation
0 references
hardness of approximation
0 references
inapproximability
0 references
TSP
0 references
TSP with neighborhoods
0 references
0.988924503326416
0 references
0.8702182173728943
0 references
0.868392288684845
0 references
0.8566784262657166
0 references
0.851916491985321
0 references
