Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
SIAM Journal on Computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics
Approximation algorithms for directed Steiner problems
Journal of Algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Directed Steiner Network Problem Is Tractable for a Constant Number of Terminals
SIAM Journal on Computing
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
ACM Transactions on Algorithms (TALG)
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximating directed buy-at-bulk network design
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
| Hi-index | 0.00 |
We consider the k-Directed Steiner Forest (k-DSF) problem: Given a directed graph G=(V,E) with edge costs, a collection D@?VxV of ordered node pairs, and an integer k=