Multi-rooted greedy approximation of directed Steiner trees with applications
From MaRDI portal
(Redirected from Publication:5200508)
Multi-rooted greedy approximation of directed Steiner trees with applications (scientific article; zbMATH DE number 6102431)
Multi-rooted greedy approximation of directed Steiner trees with applications (scientific article; zbMATH DE number 6102431)
Recommendations
- Multi-rooted greedy approximation of directed Steiner trees with applications
- A practical greedy approximation for the directed Steiner tree problem
- A practical greedy approximation for the directed Steiner tree problem
- Approximation Algorithms for Directed Steiner Problems
- scientific article; zbMATH DE number 1303557
Cited in
(12)- Multi-rooted greedy approximation of directed Steiner trees with applications
- A practical greedy approximation for the directed Steiner tree problem
- Approximation algorithm for the minimum directed tree cover
- On directed Steiner trees with multiple roots
- A practical greedy approximation for the directed Steiner tree problem
- scientific article; zbMATH DE number 1303557 (Why is no real title available?)
- scientific article; zbMATH DE number 2119644 (Why is no real title available?)
- Approximation Algorithms for Directed Steiner Problems
- Simple greedy algorithms for fundamental multidimensional graph problems
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A logarithmic integrality gap for generalizations of quasi-bipartite instances of directed Steiner tree
This page was built for publication: Multi-rooted greedy approximation of directed Steiner trees with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200508)