Abstract
Computing routing trees for multicast networks is an expensive operation. As explained in the previous chapters, a number of algorithms for this problem use models borrowed from the Steiner tree problem on graphs, as well as other network problems.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Oliveira, C.A.S., Pardalos, P.M. (2011). Center-Based Trees and Multicast Packing. In: Mathematical Aspects of Network Routing Optimization. Springer Optimization and Its Applications(), vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0311-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0311-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0310-4
Online ISBN: 978-1-4614-0311-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)