Handbook of Optimization in Telecommunications

pp 459-492

Steiner Tree Problems in Telecommunications

  • Stefan VoßAffiliated withInstitute of Information Systems, University of Hamburg

* Final gross prices may vary according to local VAT.

Get Access


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.


Steiner tree problems telecommunications network design graphs