@article{3bb9c8cc72a34e7a955fbcc4e5af05c2,
title = "Approximation algorithms for a capacitated network design problem",
abstract = "We study a capacitated network design problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support the flow at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectively models the applications traditionally formulated as capacitated tree problems. We present an approximation algorithm with performance ratio (ρST + 2) where ρST is the performance ratio of any approximation algorithm for the minimum Steiner tree problem. When all sources have unit demand, the ratio improves to ρST + 1) and, in particular, to 2 when all nodes in the graph are sources.",
keywords = "Approximation algorithms, Capacity installation, Network design, Routing flow",
author = "Refael Hassin and R. Ravi and Salman, {F. Sibel}",
year = "2003",
month = dec,
doi = "10.1007/s00453-003-1069-7",
language = "אנגלית",
volume = "38",
pages = "417--431",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",
}