Highly Influenced

# 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} }

- Published 2004 in Networks
DOI:10.1002/net.20005

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