Highly Influenced

# Improved approximation algorithms for Directed Steiner Forest

@article{Feldman2007ImprovedAA, title={Improved approximation algorithms for Directed Steiner Forest}, author={Moran Feldman and Guy Kortsarz and Zeev Nutov}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2007}, volume={14} }

- Published 2007 in J. Comput. Syst. Sci.
DOI:10.1016/j.jcss.2011.05.009

We consider the k-Directed Steiner Forest (k-DSF) problem: Given a directed graph G = (V, E) with edge costs, a collection D ⊆ V × V of ordered node pairs, and an integer k ≤ |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs (s, t) ∈ D. When k = |D|, we get the Directed Steiner Forest (DSF) problem. The best known approximation ratios for these problems are: Õ(k) for k-DSF by Charikar et al. [6], and O(k) for DSF by Chekuri et al. [7]. Our main result is… CONTINUE READING