Steiner Tree Problems in Telecommunications
- Stefan VoßAffiliated withInstitute of Information Systems, University of Hamburg
Connecting a given set of points at minimum cost may be rated as one of the most important problems in telecommunications network design. Related questions may be formulated in metric spaces as well as in graphs. Given a weighted graph, the Steiner tree problem in graphs asks to determine a minimum cost subgraph spanning a set of specified vertices. This problem may be viewed as the combinatorial optimization problem in telecommunications. In this chapter, we survey Steiner problems from a telecommunications perspective with a special emphasis on the problem in graphs.
KeywordsSteiner tree problems telecommunications network design graphs
- Steiner Tree Problems in Telecommunications
- Book Title
- Handbook of Optimization in Telecommunications
- Book Part
- pp 459-492
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, Inc.
- Additional Links
- Steiner tree problems
- network design
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.