Better \(s-t\)-tours by Gao trees (Q1800996)
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: Better \(s-t\)-tours by Gao trees |
scientific article; zbMATH DE number 6966227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better \(s-t\)-tours by Gao trees |
scientific article; zbMATH DE number 6966227 |
Statements
Better \(s-t\)-tours by Gao trees (English)
0 references
26 October 2018
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
convex combination
0 references
spanning tree
0 references
\(T\)-join
0 references
0 references
0 references
0 references
0.84966916
0 references
0.8314886
0 references
0.8310831
0 references
0.8310831
0 references
0.8308808
0 references
0.8178918
0 references
0.8174444
0 references
