The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics) - Tapa blanda

Promel, Hans Jurgen

9783528067625: The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)

Tapa blanda

ISBN 10: 3528067624 ISBN 13: 9783528067625

Editorial: Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, 2002

Ver todas las copias de esta edici�n del ISBN

7 Usado

De EUR 13,73

14 Nuevo

De EUR 50,17

"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.

Editorial: Friedr. Vieweg & Sohn Verlagsgesellschaft mbH
A�o de publicaci�n: 2002
Idioma: Ingl�s
ISBN 10: 3528067624
ISBN 13: 9783528067625
Encuadernaci�n: Tapa blanda
N�mero de p�ginas: 252
Contacto del fabricante: no disponible
Persona responsable: no disponible

Comprar usado

Ex-library with stamp and library-signature...

Ver este art�culo

EUR 13,73

Convertir moneda

EUR 16,00 gastos de env�o desde Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

A�adir al carrito

Comprar nuevo

Ver este art�culo

EUR 50,17

Convertir moneda

EUR 2,28 gastos de env�o en Estados Unidos de America

Destinos, gastos y plazos de env�o

A�adir al carrito

Otras ediciones populares con el mismo t�tulo

9783322802927: The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity

Edici�n Destacada

ISBN 10: 3322802922 ISBN 13: 9783322802927
Editorial: Vieweg+Teubner Verlag, 2012
Tapa blanda

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.

Promel, Hans Jurgen

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

Contactar al vendedor

Comprar usado

EUR 13,73

Convertir moneda

Gastos de env�o: EUR 16,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Steiner tree problem. A tour through graphs, algorithms, and complexity.

Pr�mel, Hans J�rgen:

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

Contactar al vendedor

Comprar usado

EUR 16,95

Convertir moneda

Gastos de env�o: EUR 16,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Steiner tree problem a tour through graphs, algorithms, and complexity Hans J�rgen Pr�mel, Angelika Steger.

Promel, Hans Jurgen

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

Contactar al vendedor

Comprar usado

EUR 16,96

Convertir moneda

Gastos de env�o: EUR 16,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Steiner Tree Problem. A Tour through Graphs, Algorithms, and Complexity.

Pr�mel, Hans J�rgen:

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

Contactar al vendedor

Comprar usado

EUR 24,40

Convertir moneda

Gastos de env�o: EUR 16,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Steiner tree problem. A tour through graphs, algorithms, and complexity.

Pr�mel, Hans J�rgen:

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

Contactar al vendedor

Comprar usado

EUR 24,57

Convertir moneda

Gastos de env�o: EUR 16,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Steiner Tree Problem : A Tour Through Graphs, Algorithms, and Complexity

Promel, Hans Jurgen; Steger, Angelika

Publicado por Vieweg+Teubner Verlag, 2002

ISBN 10: 3528067624 ISBN 13: 9783528067625

Nuevo Tapa blanda

Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. N� de ref. del art�culo: 7430612-n

Contactar al vendedor

Comprar nuevo

EUR 50,17

Convertir moneda

Gastos de env�o: EUR 2,28

A Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 15 disponibles

A�adir al carrito

Imagen de archivo

The Steiner Tree Problem (Paperback)

Angelika Steger

Publicado por Friedrich Vieweg & Sohn Verlagsgesellschaft mbH, Wiesbaden, 2002

ISBN 10: 3528067624 ISBN 13: 9783528067625

Nuevo Paperback

Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Paperback. Condici�n: 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. N� de ref. del art�culo: 9783528067625

Contactar al vendedor