Abstract
Consider a given undirected graph G=(V, E) with non-negative edge costs, a root node r ∈ V, and a set D ⊆ V of demands with d v representing the units of flow that demand v ∈ D wishes to send to the root. We are also given K types of cables, each with a specified capacity and cost per unit length. The single-sink buy-at-bulk (SSBB) problem asks for a low-cost installation of cables along the edges of G, such that the demands can simultaneously send their flows to sink/root r. The problem is studied with and without the restriction that the flow from a node must follow a single path to the sink (indivisibility constraint). We are allowed to install zero or more copies of a cable type on each edge. The SSBB problem is NP-hard. In this paper, we present a 145.6-approximation for the SSBB problem improving the previous best ratio of 216. For the divisible SSBB (DSSBB) problem, we improve the previous best ratio of 72.8 to α K , where α K is less than 65.49 for all K. In particular, α 2 < 12.7, α 3 < 18.2, α 4 < 23.8, α 5 < 29.3, α 6 < 33.9.
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
Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 542–547 (1997)
Bartal, Y.: Competitive analysis of distributed on-line problems-distributed paging. Ph.D. Dissertation, Tel-Aviv University, Israel (1994)
Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 170–184. Springer, Heidelberg (2001)
Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation for the single sink edge installation problems. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 383–399 (2001)
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proc. 35th ACM Symp. on Theory of Computing (STOC), pp. 365–372 (2003)
Hassin, R., Ravi, R., Salman, F.S.: Approximation algorithms for capacitated network design problems. In: Proc. 3rd Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 167–176 (2000)
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 770–779 (2000)
Salman, F.S., Cheriyan, J., Ravi, R., Subramanian, S.: Approximating the singlesink link-installation problem in network design. SIAM J. on Optimization 11(3), 595–610 (2000)
Talwar, K.: Single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 475–486. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jothi, R., Raghavachari, B. (2004). Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive