New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146)
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: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen |
scientific article; zbMATH DE number 1200786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen |
scientific article; zbMATH DE number 1200786 |
Statements
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (English)
0 references
21 September 1998
0 references
approximation algorithm
0 references
prize-collecting traveling salesman problem
0 references
k-MST
0 references
0 references
0.88873947
0 references
0.8799963
0 references
0.87600374
0 references
0.8717412
0 references
0.8693594
0 references
0.86913335
0 references
