A series of approximation algorithms for the acyclic directed Steiner tree problem

Recommendations

Approximation Algorithms for Directed Steiner Problems
scientific article; zbMATH DE number 1303557
scientific article; zbMATH DE number 2119644
Multi-rooted greedy approximation of directed Steiner trees with applications
Multi-rooted greedy approximation of directed Steiner trees with applications

Cites work

scientific article; zbMATH DE number 3677874 (Why is no real title available?)
scientific article; zbMATH DE number 1256636 (Why is no real title available?)
scientific article; zbMATH DE number 1263279 (Why is no real title available?)
A faster approximation algorithm for the Steiner problem in graphs
An 11/6-approximation algorithm for the network Steiner problem
Cost-minimal trees in directed acyclic graphs
On the hardness of approximating minimization problems
The Steiner problem with edge lengths 1 and 2
The Steiner tree problem
The computation of nearly minimal Steiner trees in graphs
The rectilinear Steiner arborescence problem
Worst-case performance of Rayward-Smith's Steiner tree heuristic

Cited in

(33)

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
Approximation Algorithms for Directed Steiner Problems
Multi-rooted greedy approximation of directed Steiner trees with applications
scientific article; zbMATH DE number 2119644 (Why is no real title available?)
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Improved approximation algorithms for directed Steiner forest
On rooted $k$-connectivity problems in quasi-bipartite digraphs
Inapproximability of survivable networks
An improved approximation scheme for the Group Steiner Problem
Online Buy-at-Bulk Network Design
On approximating degree-bounded network design problems
scientific article; zbMATH DE number 1796994 (Why is no real title available?)
Parameterized complexity of directed Steiner tree on sparse graphs
scientific article; zbMATH DE number 2230205 (Why is no real title available?)
Worst-case performance of Wong's Steiner tree heuristic
Combinatorial optimization in system configuration design
The polymatroid Steiner problems
A greedy approximation algorithm for the group Steiner problem
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
A practical greedy approximation for the directed Steiner tree problem
Directed Steiner trees with diffusion costs
A practical greedy approximation for the directed Steiner tree problem
On approximating degree-bounded network design problems
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Register loading via linear programming
Approximating fault-tolerant group-Steiner problems
Parameterized algorithms for the Steiner arborescence problem on a hypercube
New primal-dual algorithms for Steiner tree problems
On rooted $k$-connectivity problems in quasi-bipartite digraphs
Combination algorithms for Steiner tree variants
Navigational guidance -- a deep learning approach
Bounded Degree Group Steiner Tree Problems
A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems

This page was built for publication: A series of approximation algorithms for the acyclic directed Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679453)