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)

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

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)