<i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (Q5212767)
From MaRDI portal
scientific article; zbMATH DE number 7160506
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree |
scientific article; zbMATH DE number 7160506 |
Statements
<i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (English)
0 references
30 January 2020
0 references
directed Steiner tree
0 references
quasi-polynomial time
0 references
Sherali-Adams hierarchy
0 references
