Algorithms for Plane Steiner Tree Problems

@inproceedings{Thesis1998AlgorithmsFP,
  title={Algorithms for Plane Steiner Tree Problems},
  author={Martin Thesis and Zachariasen},
  year={1998}
}
Topological network design is the process of planning the layout of a network subject to constraints on topology. Applications include the design of transportation and communication networks where the construction costs typically are associated with the nodes and/or edges of the network. The Steiner tree problem is one of the fundamental topological network design problems. The problem is to interconnect (a subset of) the nodes such that there is a path between every pair of nodes while… CONTINUE READING
5 Citations
38 References
Similar Papers

Similar Papers

Loading similar papers…