Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055226597 / rank | |||
Normal rank | |||
Revision as of 02:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elementary approximation algorithms for prize collecting Steiner tree problems |
scientific article |
Statements
Elementary approximation algorithms for prize collecting Steiner tree problems (English)
0 references
19 April 2010
0 references
approximation algorithms
0 references
prize collecting Steiner tree problem
0 references
local ratio
0 references
primal-dual
0 references
