Generalizations

  • Dietmar Cieslik
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 23)

Abstract

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.

Keywords

Minimum Span Tree Delaunay Triangulation Euclidean Plane Network Design Problem Steiner Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Dietmar Cieslik
    • 1
  1. 1.Ernst-Moritz-Arndt UniversityGreifswaldGermany

Personalised recommendations