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}
}
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
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Approximation algorithms for the labelcover MAX and redblue set cover problems

  • R. Raz.
  • J . of Discrete Algorithms
  • 2007

On the unique games conjecture

  • S. Khuller.
  • 2005

Similar Papers

Loading similar papers…