Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity, PDF eBook

The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity PDF

Part of the Advanced Lectures in Mathematics series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

"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.

Information

Information