Reassembling trees for the traveling salesman (Q2806177)
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: Reassembling trees for the traveling salesman |
scientific article; zbMATH DE number 6581000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reassembling trees for the traveling salesman |
scientific article; zbMATH DE number 6581000 |
Statements
17 May 2016
0 references
traveling salesman problem
0 references
\(s\)-\(t\)-path TSP
0 references
approximation algorithm
0 references
spanning tree
0 references
0 references
0 references
0 references
Reassembling trees for the traveling salesman (English)
0 references
