Artículos relacionados a The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del 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.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 46,32
EUR 5,16 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
Imagen del vendedor
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Publicado por
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Softcover
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 2498697
Cantidad disponible: 1 disponibles
Imagen del vendedor
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Publicado por
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Softcover
Original o primera edición
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 2513577
Cantidad disponible: 1 disponibles
Imagen del vendedor
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Publicado por
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Softcover
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 2502347
Cantidad disponible: 1 disponibles
Imagen del vendedor
The Steiner Tree Problem. A Tour through Graphs, Algorithms, and Complexity.
Publicado por
Wiesbaden, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 2347626
Cantidad disponible: 1 disponibles
Imagen del vendedor
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Publicado por
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Softcover
Original o primera edición
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 2490667
Cantidad disponible: 1 disponibles
Imagen de archivo
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Publicado por
Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 687556/202
Cantidad disponible: 2 disponibles
Imagen de archivo
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Publicado por
Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuevo
Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783528067625_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
The Steiner Tree Problem
Publicado por
Vieweg+Teubner, Vieweg+Teubner Verlag Feb 2002, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783528067625
Cantidad disponible: 2 disponibles
Imagen del vendedor
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Publicado por
Vieweg+Teubner Verlag, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783528067625
Cantidad disponible: 1 disponibles
Imagen de archivo
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Publicado por
Vieweg+Teubner Verlag 2002-02, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuevo
PF
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783528067625
Cantidad disponible: 10 disponibles