Center-Based Trees and Multicast Packing

Carlos A. S. Oliveira () and Panos M. Pardalos ()
Additional contact information
Carlos A. S. Oliveira: Bloomberg LP
Panos M. Pardalos: University of Florida

Chapter Chapter 6 in Mathematical Aspects of Network Routing Optimization, 2011, pp 65-75 from Springer

Abstract: 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.

Keywords: Center Node; Multicast Tree; Multicast Group; Steiner Tree Problem; Rendezvous Point (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-0311-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461403111

DOI: 10.1007/978-1-4614-0311-1_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().