Verwandte Artikel zu 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
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Prof. Dr. Jürgen Prömel ist am Institut für Informatik der Humboldt Universität zu Berlin tätig, Prof. Dr. Angelika Steger lehrt am Institut für Informatik der TU München.
Von der hinteren Coverseite
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. No specific previous knowledge is assumed.
The central theme of the book is a geometrical problem dating back to Jakob Steiner. This problem, now called the Steiner problem, was initially of importance only within the context of land surveying. In the last decade, however, applications as diverse as VLSI-layout and the study of phylogenetic trees led to a rapid rise of interest in this problem. The resulting progress has uncovered fascinating connections between and within graph theory, the study of algorithms, and complexity theory. This single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms, computational complexity, approximation algorithms, the use of randomness, limits of approximability.
A special feature of the book is that each chapter ends with an "excursion" into some related area. These excursions reinforce the concepts and methods introduced for the Steiner problem by placing them in a broader context.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 42,79
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
Foto des Verkäufers
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 PRO 9783528067625 Sprache: Englisch Gewicht in Gramm: 550. Bestandsnummer des Verkäufers 2498697
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 687556/202
Anzahl: 2 verfügbar
Foto des Verkäufers
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Verlag:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Gebraucht
Softcover
Erstausgabe
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Softcover. 1. ed. VIII, 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. D03869 9783528067625 Sprache: Englisch Gewicht in Gramm: 550. Bestandsnummer des Verkäufers 2513577
Anzahl: 1 verfügbar
Foto des Verkäufers
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 PRO 9783528067625 Sprache: Englisch Gewicht in Gramm: 550. Bestandsnummer des Verkäufers 2502347
Anzahl: 1 verfügbar
Foto des Verkäufers
The Steiner Tree Problem. A Tour through Graphs, Algorithms, and Complexity.
Verlag:
Wiesbaden, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Gebraucht
Softcover
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 2347626
Anzahl: 1 verfügbar
Foto des Verkäufers
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Verlag:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Gebraucht
Softcover
Erstausgabe
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 2490667
Anzahl: 1 verfügbar
Foto des Verkäufers
The Steiner Tree Problem
Verlag:
Vieweg+Teubner, Vieweg+Teubner Verlag Feb 2002, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783528067625
Anzahl: 2 verfügbar
Foto des Verkäufers
The Steiner Tree Problem
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Prof. Dr. Juergen Proemel ist am Institut fuer Informatik der Humboldt Universitaet zu Berlin taetig, Prof. Dr. Angelika Steger lehrt am Institut fuer Informatik der TU Muenchen.In recent years, algorithmic graph theory has become increasingly important as a l. Bestandsnummer des Verkäufers 4866994
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Verlag:
Vieweg+Teubner Verlag, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783528067625
Anzahl: 1 verfügbar
Foto des Verkäufers
The Steiner Tree Problem
Verlag:
Vieweg+Teubner Verlag, Vieweg+Teubner Verlag Feb 2002, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Vieweg in Springer Science + Business Media, Abraham-Lincoln-Straße 46, 65189 Wiesbaden 252 pp. Englisch. Bestandsnummer des Verkäufers 9783528067625
Anzahl: 1 verfügbar