New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s009753979528826x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998678640 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
scientific article; zbMATH DE number 1200786
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
