scientific article; zbMATH DE number 1303557
From MaRDI portal
Publication:4250182
Recommendations
- Approximation Algorithms for Directed Steiner Problems
- scientific article; zbMATH DE number 2119644
- An improved approximation scheme for the Group Steiner Problem
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Multi-rooted greedy approximation of directed Steiner trees with applications
Cited in
(45)- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- An approach for the Steiner problem in directed graphs
- Approximating the weight of shallow Steiner trees
- Directed Steiner problems with connectivity constraints
- Bayesian generalized network design
- Subjectively interesting connecting trees and forests
- On the edge capacitated Steiner tree problem
- Augmenting weighted graphs to establish directed point-to-point connectivity
- The polymatroid Steiner problems
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Steiner problems with limited number of branching nodes
- Directed Steiner tree with branching constraint
- A practical greedy approximation for the directed Steiner tree problem
- On network design problems: fixed cost flows and the covering Steiner problem
- Approximability of unsplittable shortest path routing problems
- Approximation Algorithms for Steiner and Directed Multicuts
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Designing hypergraph layouts to GMPLS routing strategies
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- Directed Steiner trees with diffusion costs
- A practical greedy approximation for the directed Steiner tree problem
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- On the approximability of dense Steiner problems
- An approximation algorithm for the k-level concentrator location problem
- Improved approximation algorithms for directed Steiner forest
- GMPLS label space minimization through hypergraph layouts
- scientific article; zbMATH DE number 2079350 (Why is no real title available?)
- Algorithms for a network design problem with crossing supermodular demands
- Approximating directed Steiner problems via tree embedding
- Improved approximating algorithms for directed Steiner forest
- scientific article; zbMATH DE number 2119644 (Why is no real title available?)
- Approximation algorithms for multicast routing in ad hoc wireless networks
- Approximation Algorithms for Directed Steiner Problems
- Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
- Graph Clustering using Effective Resistance
- Efficient black-box reductions for separable cost sharing
- RNC-approximation algorithms for the steiner problem
- Bayesian generalized network design
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- 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
- Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
- Algorithms and Computation
- A series of approximation algorithms for the acyclic directed Steiner tree problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250182)
