An optimal algorithm for online prize-collecting node-weighted Steiner forest (Q1671004)
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: An optimal algorithm for online prize-collecting node-weighted Steiner forest |
scientific article; zbMATH DE number 6932705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for online prize-collecting node-weighted Steiner forest |
scientific article; zbMATH DE number 6932705 |
Statements
An optimal algorithm for Online Prize-Collecting Node-Weighted Steiner Forest (English)
0 references
6 September 2018
0 references
online algorithms
0 references
competitive analysis
0 references
Steiner forest
0 references
Steiner tree
0 references
prize-collecting
0 references
node-weighted graphs
0 references
penalties
0 references
0.8947673439979553
0 references
0.8460387587547302
0 references
0.8432467579841614
0 references
0.8228819370269775
0 references
0.8143519163131714
0 references
