Improved approximation algorithms for prize-collecting Steiner tree and TSP (Q3020008)
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: Improved approximation algorithms for prize-collecting Steiner tree and TSP |
scientific article; zbMATH DE number 5934229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for prize-collecting Steiner tree and TSP |
scientific article; zbMATH DE number 5934229 |
Statements
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP (English)
0 references
29 July 2011
0 references
approximation algorithms
0 references
Steiner tree
0 references
traveling salesman
0 references
prize-collecting
0 references
0.8814818263053894
0 references
0.8797956705093384
0 references
0.8625924587249756
0 references
