Approximation Algorithms for a Capacitated Network Design Problem
Lists
Only you see this
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.
BibTeX
@article{hassin2004approximation,
author = {Refael Hassin and R. Ravi and F. Sibel Salman},
title = {{Approximation Algorithms for a Capacitated Network Design Problem}},
journal = {Algorithmica},
year = {2004},
doi = {10.1007/s00453-003-1069-7},
}Loading related content...