„Directed Steiner Tree“
Suchergebnisse
17 Treffer
-
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
-
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
-
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
-
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs
-
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs
-
Budgeted Out-Tree Maximization with Submodular Prizes
-
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
-
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
-
On Approximating Degree-Bounded Network Design Problems
-
Approximating Directed Steiner Problems via Tree Embedding
-
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)
-
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
-
A dual ascent approach for steiner tree problems on a directed graph
-
A series of approximation algorithms for the acyclic directed steiner tree problem
-
A polynomial time subpolynom approximation scheme for the acyclic directed Steiner tree problem
-
Directed Steiner trees with diffusion costs
-
A practical greedy approximation for the directed Steiner tree problem