Graphs lend themselves as natural models of transportation as well as communication networks. Consequently, it is natural to study network design problems such as optimal facility location problems for graphs and as graphs in metric spaces. The origin of all is Steiner’s Problem. We will see that this is not only a single problem but also a group of problems of relatives, specifications and generalizations of the original problem by Steiner1.
KeywordsMinimum Span Tree Delaunay Triangulation Euclidean Plane Network Design Problem Steiner Point
Unable to display preview. Download preview PDF.