A \(O(\log k)\)-approximation for \textsc{Directed Steiner Tree} in planar graphs (Q6907341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8114587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(O(\log k)\)-approximation for \textsc{Directed Steiner Tree} in planar graphs |
scientific article; zbMATH DE number 8114587 |
Statements
A \(O(\log k)\)-approximation for \textsc{Directed Steiner Tree} in planar graphs (English)
0 references
3 November 2025
0 references
directed Steiner tree
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
