The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740)
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: The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems |
scientific article; zbMATH DE number 500534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems |
scientific article; zbMATH DE number 500534 |
Statements
The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (English)
0 references
19 May 1994
0 references
competitive analysis
0 references
randomized on-line algorithms
0 references
on-line Steiner tree
0 references
on-line spanning tree
0 references
0.92296284
0 references
0.91590583
0 references
0.9098391
0 references
0.90981865
0 references
0.89196175
0 references
0.88807774
0 references
0.88575095
0 references
0.8835122
0 references
