Abstract
The capacitated tree-routing problem (CTR) in a graph G = (V,E) consists of an edge weight function w:E→R + , a sink s ∈ V, a terminal set M ⊆ V with a demand function q:M→R + , a routing capacity κ> 0, and an integer edge capacity λ ≥ 1. The CTR asks to find a partition \({\cal M}=\{Z_{1},Z_{2},\ldots,Z_{\ell}\}\) of M and a set \({\cal T}=\{T_{1},T_{2},\ldots,T_{\ell}\}\) of trees of G such that each T i spans Z i ∪ {s} and satisfies \(\sum_{v\in Z_{i}}q(v)\leq \kappa\). A subset of trees in \({\cal T}\) can pass through a single copy of an edge e ∈ E as long as the number of these trees does not exceed the edge capacity λ; any integer number of copies of e are allowed to be installed, where the cost of installing a copy of e is w(e). The objective is to find a solution \(({\cal M}, {\cal T})\) that minimizes the installing cost \(\sum_{e\in E} \lceil |\{T\in {\cal T}\mid T \mbox{ contains }e\}| /\lambda \rceil w(e)\). In this paper, we propose a \((2+\rho_{\mbox{\tiny{\sc ST}}})\)-approximation algorithm to the CTR, where \(\rho_{\mbox{\tiny{\sc ST}}}\) is any approximation ratio achievable for the Steiner tree problem.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cai, Z., Lin, G.-H., Xue, G.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 136–145. Springer, Heidelberg (2005)
Hassin, R., Ravi, R., Salman, F.S.: Approximation algorithms for a capacitated network design problem. Algorithmica 38, 417–431 (2004)
Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. In: Díaz, J., et al. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 805–818. Springer, Heidelberg (2004)
Mansour, Y., Peleg, D.: An approximation algorithm for minimum-cost network design. Tech. Report Cs94-22, The Weizman Institute of Science, Rehovot (1994), also presented at the DIMACS Workshop on Robust Communication Network (1998)
Morsy, E., Nagamochi, H.: An improved approximation algorithm for capacitated multicast routings in networks. In: Proceedings of International Symposium on Scheduling 2006, Tokyo, Japan, pp. 12–17 (2006)
Robins, G., Zelikovsky, A.Z.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms-SODA’2000, pp. 770–779 (2000)
Salman, F.S., et al.: Approximating the single-sink link-installation problem in network design. SIAM J. Optim. 11, 595–610 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morsy, E., Nagamochi, H. (2007). Approximating Capacitated Tree-Routings in Networks. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)