The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:56, 31 January 2024
scientific article
| 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 |
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
