Abstract
We study a network loading 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 flows 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 minimum Steiner tree. When all sources have the same demand value, the ratio improves to (nST +1) and in particular, to 2 when all nodes in the graph are sources.
This work was done when this author visited GSIA, Carnegie Mellon University.
Supported by an NSF CAREER grant CCR-9625297.
Supported by an IBM Corporate Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Altinkemer and B. Gavish, “Heuristics with constant error guarantees for the design of tree networks,” Management Science, 34, (1988) 331–341
M. Andrews and L. Zhang, “The access network design problem,” In Proc. of the 39th Ann. IEEE Symp. on Foundations of Computer Science, (1998) 42–49
K. M. Chandy and T. Lo, “The capacitated minimum tree,” Networks, 3, (1973) 173–182
Kawatra, R. and D. L. Bricker, “A multiperiod planning model for the capacitated minimal spanning tree problem”, to appear in European Journal of Operational Research (1998)
A. Kershenbaumand R. Boorstyn, “Centralized teleprocessing network design,” Networks, 13, (1983) 279–293
S. Khuller, B. Raghavachari and N. E. Young, “Balancing minimum spanning and shortest path trees,” Algorithmica, 14, (1993) 305–322
Y. Mansour and D. Peleg, “An approximation algorithm for minimum-cost network design,” The Weizman Institute of Science, Rehovot, 76100 Israel, Tech. Report CS94-22, 1994; Also presented at the DIMACS workshop on Robust Communication Networks, 1998.
C. H. Papadimitriou, “The complexity of the capacitated tree problem,” Networks, 8, (1978) 217–230
G. Robins and A. Zelikovsky, “Improved steiner tree approximation in graphs”, Proc. of the 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, (2000) 770–779
F.S. Salman, J. Cheriyan, R. Ravi and S. Subramanian, “Buy-at-bulk network design: Approximating the single-sink edge installation problem,” Proc. of the 8th Ann. ACM-SIAM Symposium on Discrete Algorithms, (1997) 619–628
R. L. Sharma, “Design of an economical multidrop network topology with capacity constraints,” IEEE Trans. Comm., 31, (1983) 590–591
B. Sanso and P. Soriano, Editors, “Telecommunications Network Planning,” Kluwer Academic Publishers, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Ravi, R., Salman, F.S. (2000). Approximation Algorithms for a Capacitated Network Design Problem. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive