Items related to The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics) - Softcover
Synopsis
In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.
"synopsis" may belong to another edition of this title.
Review
"The book is a very good introduction to discrete mathematics in relation to computer science, and a useful reference for those who are interested in network optimization problems." Zentralblatt MATH, Nr. 17/02
"This book is an excellent introduction to the Steiner tree problems, which starts with network Steiner trees an ends with geometric Steiner trees." Mathematical Reviews, Nr. 11/02
Book Description
Discrete mathematics in relation to computer science
"About this title" may belong to another edition of this title.
- PublisherVieweg+Teubner Verlag
- Publication date2002
- ISBN 10 3528067624
- ISBN 13 9783528067625
- BindingPaperback
- LanguageEnglish
- Number of pages249
Search results for The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
Seller Image
The Steiner Tree Problem. A Tour through Graphs, Algorithms, and Complexity.
Published by
Wiesbaden, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
241 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7928 9783528067625 Sprache: Englisch Gewicht in Gramm: 900. Seller Inventory # 2347626
Quantity: 1 available
Seller Image
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Published by
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Used
Softcover
First Edition
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Softcover. 1. ed. VIII, 241 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04432 9783528067625 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2490667
Quantity: 1 available
Stock Image
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783528067625
Quantity: 2 available
Stock Image
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783528067625
Quantity: Over 20 available
Stock Image
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783528067625
Quantity: 10 available
Stock Image
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783528067625_new
Quantity: Over 20 available
Seller Image
The Steiner Tree Problem
Published by
Vieweg+Teubner, Vieweg+Teubner Verlag Feb 2002, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'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. 241 pp. Englisch. Seller Inventory # 9783528067625
Quantity: 2 available
Stock Image
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 252 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 687556/202
Quantity: 2 available
Seller Image
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - '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. Seller Inventory # 9783528067625
Quantity: 1 available
Stock Image
The Steiner Tree Problem
Published by
Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 262053502
Quantity: 4 available