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
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
"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
Descrizione del libro
Discrete mathematics in relation to computer science
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreFriedr. Vieweg & Sohn Verlagsgesellschaft mbH
- Data di pubblicazione2002
- ISBN 10 3528067624
- ISBN 13 9783528067625
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine252
Compra nuovo
Visualizza questo articolo
EUR 45,60
EUR 6,18 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.
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
Foto dell'editore
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9783528067625
Quantità: 2 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
Foto dell'editore
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783528067625
Quantità: 10 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
Immagini fornite dal venditore
The Steiner Tree Problem
Editore:
Vieweg+Teubner, Vieweg+Teubner Verlag Feb 2002, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783528067625
Quantità: 2 disponibili
Immagini fornite dal venditore
The Steiner Tree Problem : A Tour through Graphs, Algorithms, and Complexity
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783528067625
Quantità: 1 disponibili
Foto dell'editore
The 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: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 687556/202
Quantità: 2 disponibili
Foto dell'editore
The Steiner Tree Problem
Editore:
Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 2002
ISBN 10: 3528067624
ISBN 13: 9783528067625
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 262053502
Quantità: 4 disponibili