Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization (Q3829359)
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: Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization |
scientific article; zbMATH DE number 4104728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization |
scientific article; zbMATH DE number 4104728 |
Statements
Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization (English)
0 references
1989
0 references
asymptotic worst-case behavior
0 references
length of a minimal spanning tree
0 references
optimal traveling salesman tour
0 references
unit d-cube
0 references
0.8677780032157898
0 references
0.8462228775024414
0 references
0.8456648588180542
0 references
0.7995173335075378
0 references
