Articoli correlati 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) - Brossura
Sinossi
Discrete mathematics in relation to computer science
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 50,19
EUR 2,28 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per The Steiner Tree Problem: A Tour through Graphs, Algorithms,...
Immagini fornite dal venditore
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Editore:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Softcover
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2498697
Quantità: 1 disponibili
Immagini fornite dal venditore
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Editore:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Softcover
Prima edizione
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2513577
Quantità: 1 disponibili
Immagini fornite dal venditore
The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel, Angelika Steger.
Editore:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Softcover
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2502347
Quantità: 1 disponibili
Immagini fornite dal venditore
The Steiner Tree Problem. A Tour through Graphs, Algorithms, and Complexity.
Editore:
Wiesbaden, Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Brossura
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2347626
Quantità: 1 disponibili
Immagini fornite dal venditore
The Steiner tree problem. A tour through graphs, algorithms, and complexity.
Editore:
Braunschweig, Vieweg, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Softcover
Prima edizione
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2490667
Quantità: 1 disponibili
Immagini fornite dal venditore
Steiner Tree Problem : A Tour Through Graphs, Algorithms, and Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 7430612-n
Quantità: 15 disponibili
Foto dell'editore
The Steiner Tree Problem (Paperback)
Editore:
Friedrich Vieweg & Sohn Verlagsgesellschaft mbH, Wiesbaden, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. In recent years, algorithmic graph theory has become increasingly important since it serves as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graph 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 tree problem, was initially of importance only within the context of land surveying. Recent applications, as diverse as VLSI-layout and the study of phylogenetic trees, have, however, lead to significant interest in the problem. The resulting progress has uncovered fascinating connections to and among graph theory, the study of algorithms and complexity. The single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms; computational complexity; approximation algorithms; limits of approximability; randomness helps; the Manhattan Steiner problem; heuristics; packing of Steiner trees; and applications.A fundamental 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 tree problem by putting them in a broader context. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9783528067625
Quantità: 1 disponibili
Foto dell'editore
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783528067625
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Steiner Tree Problem : A Tour Through Graphs, Algorithms, and Complexity
Editore:
Vieweg+Teubner Verlag, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Antico o usato
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 7430612
Quantità: 15 disponibili
Foto dell'editore
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783528067625_new
Quantità: Più di 20 disponibili