Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem (Q2938096)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem |
scientific article |
Statements
Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem (English)
0 references
13 January 2015
0 references
online algorithms
0 references
advice complexity
0 references
minimum Steiner tree
0 references
