Approximation Algorithms for Directed Steiner Problems

Recommendations

scientific article; zbMATH DE number 1303557
scientific article; zbMATH DE number 2119644
Multi-rooted greedy approximation of directed Steiner trees with applications
An improved approximation scheme for the Group Steiner Problem
A series of approximation algorithms for the acyclic directed Steiner tree problem

Cited in

(only showing first 100 items - show all)

Inapproximability of survivable networks
Combinatorial optimization in system configuration design
An approach for the Steiner problem in directed graphs
Directed Steiner problems with connectivity constraints
Swap-vertex based neighborhood for Steiner tree problems
Clearing directed subgraphs by mobile agents. Variations on covering with paths
An algorithmic framework for the exact solution of tree-star problems
On a class of branching problems in broadcasting and distribution
The General Steiner Tree-Star problem.
On approximation of dominating tree in wireless sensor networks
On rooted $k$-connectivity problems in quasi-bipartite digraphs
Tight bounds on subexponential time approximation of set cover and related problems
On approximating degree-bounded network design problems
Greedy algorithms for the profit-aware social team formation problem
Heuristic and exact algorithms for minimum-weight non-spanning arborescences
A polylogarithmic approximation algorithm for 2-edge-connected dominating set
Parameterized analysis of the online priority and node-weighted Steiner tree problems
Hardness and approximation results for packing Steiner trees
Approximating node-connectivity augmentation problems
The subdivision-constrained routing requests problem
Steiner diagrams and $k$-star hubs
Bounded-hops power assignment in ad hoc wireless networks
Approximating the two-level facility location problem via a quasi-greedy approach
The polymatroid Steiner problems
A greedy approximation algorithm for the group Steiner problem
Multi-rooted greedy approximation of directed Steiner trees with applications
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
Combination algorithms for Steiner tree variants
A practical greedy approximation for the directed Steiner tree problem
On network design problems: fixed cost flows and the covering Steiner problem
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
Approximation algorithm for the minimum directed tree cover
On directed Steiner trees with multiple roots
Set connectivity problems in undirected graphs and the directed Steiner network problem
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
Lehman's theorem and the directed Steiner tree problem
A practical greedy approximation for the directed Steiner tree problem
On some network design problems with degree constraints
Set connectivity problems in undirected graphs and the directed Steiner network problem
Approximation algorithms for orienting mixed graphs
On the approximability of dense Steiner problems
Improved approximation algorithms for directed Steiner forest
scientific article; zbMATH DE number 1303557 (Why is no real title available?)
Online Buy-at-Bulk Network Design
Approximating directed Steiner problems via tree embedding
Improved approximating algorithms for directed Steiner forest
Spider covering algorithms for network design problems
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
scientific article; zbMATH DE number 2119644 (Why is no real title available?)
Preprocessing for a map sectorization problem by means of mathematical programming
On the hardness of full Steiner tree problems
Approximating $k$-generalized connectivity via collapsing HSTs
Register loading via linear programming
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
Efficient black-box reductions for separable cost sharing
ETH-hardness of approximating 2-CSPs and directed Steiner network
Bounded Degree Group Steiner Tree Problems
RNC-approximation algorithms for the steiner problem
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Cost-optimal planning, delete relaxation, approximability, and heuristics
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Multi-rooted greedy approximation of directed Steiner trees with applications
O(^2 k/ k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
Parameterized complexity of directed Steiner tree on sparse graphs
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
Steiner shallow-light trees are exponentially lighter than spanning ones
scientific article; zbMATH DE number 2230205 (Why is no real title available?)
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
scientific article; zbMATH DE number 7053371 (Why is no real title available?)
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Solving Steiner trees: Recent advances, challenges, and perspectives
Navigational guidance -- a deep learning approach
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
On rooted $k$-connectivity problems in quasi-bipartite digraphs
Better trees for Santa Claus
The parameterized complexity of the survivable network design problem
A series of approximation algorithms for the acyclic directed Steiner tree problem
On the exact \& approximate complexity of the strongly connected Steiner subgraph problem on two terminals with demands
Approximation algorithms for _p-shortest path and _p-group Steiner tree
Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
On the bidirected cut relaxation for Steiner forest
A logarithmic integrality gap for generalizations of quasi-bipartite instances of directed Steiner tree
A $O(\log k)$-approximation for \textsc{Directed Steiner Tree} in planar graphs
On the constrained Steiner strong connectivity augmentation problem
A new approach for approximating directed rooted networks
Approximation algorithms for node-weighted directed Steiner problems
The complexity landscape of fixed-parameter directed Steiner network problems
Polynomial integrality gap of flow LP for directed Steiner tree
The strongish planted clique hypothesis and its consequences
Approximation algorithms for directed weighted spanners
From directed Steiner tree to directed polymatroid Steiner tree in planar graphs
Complexity and approximation algorithms for fixed charge transportation problems

This page was built for publication: Approximation Algorithms for Directed Steiner Problems

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