"A very simple but instructive problem was treated by Jacob Steiner, the famous representative of geometry at the University of Berlin in the early nineteenth century. Three villages A, B , C are to be joined by a system of roads of minimum length. " Due to this remark of Courant and Robbins (1941), a problem received its name that actually reaches two hundred years further back and should more appropriately be attributed to the French mathematician Pierre Fermat. At the end of his famous treatise "Minima and Maxima" he raised the question to find for three given points in the plane a fourth one in such a way that the sum of its distances to the given points is minimized – that is, to solve the problem mentioned above in its mathematical abstraction. It is known that Evangelista Torricelli had found a geometrical solution for this problem already before 1640. During the last centuries this problem was rediscovered and generalized by many mathematicians, including Jacob Steiner. Nowadays the term "Steiner prob- lem" refers to a problem where a set of given points PI, . . . , Pn have to be connected in such a way that (i) any two of the given points are joined and (ii) the total length (measured with respect to some predefined cost function) is minimized.
Hans Jurgen Promel & Angelika Steger
Steiner Tree Problem [PDF ebook]
A Tour through Graphs, Algorithms, and Complexity
Steiner Tree Problem [PDF ebook]
A Tour through Graphs, Algorithms, and Complexity
购买此电子书可免费获赠一本!
语言 英语 ● 格式 PDF ● ISBN 9783322802910 ● 出版者 Vieweg+Teubner Verlag ● 发布时间 2012 ● 下载 3 时 ● 货币 EUR ● ID 6304180 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器