Steiner Tree Problems in Telecommunications
Steiner Tree Problems in Telecommunications
复制标题
DOI：
10.1007/978-0-387-30165-5_18
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
S. Voß
中科院分区：
文献类型：
--
作者：
S. Voß
以最小的成本连接一组给定的点可能被认为是电信网络设计中最重要的问题之一。相关问题可以用度量空间和图形来表述。给定一个加权图，图中的斯坦纳树问题要求确定跨越一组指定顶点的最小成本子图。这个问题可以被视为电信中的组合优化问题。在本章中，我们从电信角度审视斯坦纳问题，特别强调图表中的问题。
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, theSteiner tree problem in graphsasks to determine a minimum cost subgraph spanning a set of specified vertices. This problem may be viewed asthecombinatorial optimization problem in telecommunications. In this chapter, we survey Steiner problems from a telecommunications perspective with a special emphasis on the problem in graphs.