An explicit lower bound for TSP with distances one and two (Q1402211)
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: An explicit lower bound for TSP with distances one and two |
scientific article; zbMATH DE number 1967762
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An explicit lower bound for TSP with distances one and two |
scientific article; zbMATH DE number 1967762 |
Statements
An explicit lower bound for TSP with distances one and two (English)
0 references
19 August 2003
0 references
traveling salesman problem
0 references
approximability
0 references
gadget reductions
0 references
lower bounds
0 references
0.94321865
0 references
0 references
0.8784989
0 references
0.87829435
0 references
0.86906767
0 references
0.8647652
0 references
0.86416435
0 references
0.86374384
0 references
