Abstract
We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find a Steiner tree spanning the source and destination nodes such that the maximum total delay along a path from the source node to a destination node is minimized, while the sum of link costs in the tree is bounded by a constant. The problem is \(\mathcal{NP}\)-hard even if the network is series-parallel. We present a fully polynomial time approximation scheme for the problem if the network is series-parallel.
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
Chan, G., Xue, G.: k-pair delay constrained minimum cost routing in undirected networks. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 230–231 (2001)
Kompella, V., Pasquale, J., Polyzos, G.: Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1, 286–292 (1993)
Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J.: An iterative algorithm for delay-constrained minimum-cost multicast. IEEE/ACM Trans. Networking 6, 213–219 (2001)
Sriram, R., Manimaran, G., Murthy, C.: Algorithms for delay-constrained low-cost multicast tree construction. Computer Communications 21, 1693–1706 (1998)
Youssef, H., AI-Mulhem, A., Sait, S., Tahir, M.: QoS-driven multicast tree generation using tabu search. Computer Communications 25, 1140–1149 (2002)
Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17, 36–42 (1992)
Chen, G., Xue, G.: A PTAS for weight constrained steiner trees in series-parallel graphs. Theoretical Computer Science 304, 237–247 (2003)
Wald, J., Colbourn, C.: Steiner trees, partial 2-trees and minimum IFI networks. Networks 13, 159–167 (1983)
Lorenz, D., Raz, D.: A simple efficient approximation scheme for the restricted path problem. Operations Research Letters 28, 213–219 (2001)
Warburton, A.: Approximation of pareto optima in multiple-objective shortest path problems. Operations Research 35, 70–79 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tayu, S., Al-Mutairi, T.G., Ueno, S. (2005). Cost-Constrained Minimum-Delay Multicasting. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)