A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244)
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: A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots |
scientific article; zbMATH DE number 6573368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots |
scientific article; zbMATH DE number 6573368 |
Statements
25 April 2016
0 references
approximation algorithm
0 references
multiple depots
0 references
traveling salesman
0 references
matroid
0 references
0 references
0 references
0 references
0 references
0 references
0.9584688
0 references
0.92377275
0 references
0.91453964
0 references
0.90131515
0 references
0.8929409
0 references
0.8879194
0 references
0.8833506
0 references
0.88020396
0 references
0.8773823
0 references
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (English)
0 references
