Algorithms for a network design problem with crossing supermodular demands

@article{Melkonian2004AlgorithmsFA,
  title={Algorithms for a network design problem with crossing supermodular demands},
  author={Vardges Melkonian and {\'E}va Tardos},
  journal={Networks},
  year={2004},
  volume={43},
  pages={256-265}
}
We present approximation algorithms for a class of directed network design problems. The network design problem is to find a minimum cost subgraph such that for each vertex set S there are at least f(S) arcs leaving the set S. In the last 10 years general techniques have been developed for designing approximation algorithms for undirected network design problems. Recently, Kamal Jain gave a 2-approximation algorithm for the case when the function f is weakly supermodular. There has been very… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

References

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

Geometric al- gorithms and combinatorial optimization, Springer-Verlag, Berlin

  • M. Grotschel, L. Lovasz, A. Schrijver
  • 1988
Highly Influential
4 Excerpts

Kernel systems of directed graphs

  • A. Frank
  • Acta Sci Math
  • 1979
Highly Influential
10 Excerpts

A series of approximation algorithms for the acyclic directed Steiner tree

  • A. Zelikovski
  • problem, Algorithmica
  • 1997
2 Excerpts

Khuller and U . Vishkin , Biconnectivity approximations and graph carvings

  • M. X. Goemans D. P. Williamson, M. Mihail, V. V. Vazirani
  • J Assoc Comput Machinery
  • 1994

Similar Papers

Loading similar papers…