Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances (Q3115676)
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: Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances |
scientific article; zbMATH DE number 6004937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances |
scientific article; zbMATH DE number 6004937 |
Statements
10 February 2012
0 references
NP-hard problem
0 references
traveling salesman problem
0 references
0.8798172473907471
0 references
0.8601569533348083
0 references
