Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
13 Angebote vergleichen
Preise | 2014 | 2015 | 2020 | 2021 | 2023 |
---|---|---|---|---|---|
Schnitt | € 53,85 | € 50,01 | € 41,32 | € 42,97 | € 42,65 |
Nachfrage |
The Steiner Tree Problem (2002)
ISBN: 9783528067625 bzw. 3528067624, vermutlich in Deutsch, Vieweg & Teubner, Taschenbuch, neu.
'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. Taschenbuch, 25.02.2002.
The Steiner Tree Problem (2002)
ISBN: 9783528067625 bzw. 3528067624, vermutlich in Englisch, Vieweg & Teubner, Taschenbuch, neu.
'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. Taschenbuch, 25.02.2002.
The Steiner Tree Problem (1941)
ISBN: 9783528067625 bzw. 3528067624, vermutlich in Englisch, Springer Shop, Taschenbuch, neu.
"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. Soft cover.
The Steiner Tree Problem (1941)
ISBN: 9783322802910 bzw. 3322802914, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
"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. eBook.
The Steiner Tree Problem (2002)
ISBN: 9783322802910 bzw. 3322802914, in Deutsch, Vieweg+Teubner Verlag, neu, E-Book.
*The Steiner Tree Problem* - A Tour through Graphs Algorithms and Complexity. Auflage 2002 / pdf eBook für 42.99 € / Aus dem Bereich: eBooks, Fachthemen & Wissenschaft, Mathematik.
The Steiner Tree Problem (2002)
ISBN: 9783322802910 bzw. 3322802914, in Deutsch, Vieweg+Teubner Verlag, Vieweg+Teubner Verlag, neu, E-Book.
The Steiner Tree Problem - A Tour through Graphs Algorithms and Complexity. Auflage 2002: ab 42.99 €.
The Steiner Tree Problem: A Tour Through Graphs, Algorithms and Complexity (Advanced Lectures in Mathematics)
ISBN: 9783528067625 bzw. 3528067624, in Englisch, Friedrich Vieweg & Sohn Verlagsgesellschaft mbH, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
The Steiner Tree Problem (2002)
ISBN: 9783528067625 bzw. 3528067624, vermutlich in Englisch, Vieweg & Teubner Verlag Feb 2002, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, BuchWeltWeit Inh. Ludwig Meier e.K. [57449362], Bergisch Gladbach, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity (2002)
ISBN: 9783528067625 bzw. 3528067624, vermutlich in Englisch, Vieweg & Teubner Verlag, Taschenbuch, neu.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
The Steiner Tree Problem (2002)
ISBN: 9783528067625 bzw. 3528067624, in Deutsch, Vieweg & Teubner Verlag Feb 2002, Taschenbuch, neu.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen