A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry (Q3541076)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry |
scientific article |
Statements
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry (English)
0 references
25 November 2008
0 references
