SpeedSteiner: A Fast O ( k 1/2 )-Approximation Algorithm for Directed Steiner Tree
Open Access
- 10 November 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 4096-4105
Abstract
No abstract availableFunding Information
- Research Council of Finland (343045)
- ERC Advanced Grant (834862)
- Swedish Research Council (2024-05603)
- Knut and Alice Wallenberg Foundation (WASP)
This publication has 22 references indexed in Scilit:
- A practical greedy approximation for the directed Steiner tree problemJournal of Combinatorial Optimization, 2016
- Finding Top-k Min-Cost Connected Trees in Databases2007
- The Directed Steiner Network Problem is Tractable for a Constant Number of TerminalsSIAM Journal on Computing, 2006
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- New approximation algorithms for routing with multiport terminalsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000
- An improved approximation scheme for the Group Steiner ProblemNetworks, 2000
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- A series of approximation algorithms for the acyclic directed steiner tree problemAlgorithmica, 1997
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- The steiner problem in graphsNetworks, 1971