Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs |
scientific article; zbMATH DE number 7758365
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs |
scientific article; zbMATH DE number 7758365 |
Statements
31 October 2023
0 references
approximation algorithms
0 references
network design
0 references
directed graphs
0 references
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
