$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148)
From MaRDI portal
scientific article; zbMATH DE number 7680893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm |
scientific article; zbMATH DE number 7680893 |
Statements
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (English)
0 references
28 April 2023
0 references
approximation algorithms
0 references
hardness of approximation
0 references
network design
0 references
directed Steiner tree
0 references
0 references
0 references
0 references
