Steiner Trees and Multicast

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 3 in Mathematical Aspects of Network Routing Optimization, 2011, pp 29-45 from Springer

Abstract: Abstract Steiner trees have for many years been an important problem in Operations Research. They have been used to model a variety of applications, ranging from transportation to computer aided design. As such, Steiner trees have received a lot of attention in the optimization literature, with several theoretical and practical results appearing each year.

Keywords: Short Path; Steiner Tree; Multicast Tree; Multicast Group; Maximum Delay (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_3

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

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

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 ().