The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity: Advanced Lectures in Mathematics
Autor Hans Jürgen Prömel, Angelika Stegeren Limba Engleză Paperback – 25 feb 2002
Din seria Advanced Lectures in Mathematics
- Preț: 315.86 lei
- Preț: 69.93 lei
- Preț: 480.74 lei
- 15% Preț: 488.41 lei
- Preț: 408.33 lei
- 15% Preț: 432.61 lei
- Preț: 413.46 lei
- Preț: 484.53 lei
- 15% Preț: 457.04 lei
- Preț: 411.00 lei
- Preț: 308.70 lei
- Preț: 259.79 lei
- 19% Preț: 436.85 lei
- Preț: 283.88 lei
- Preț: 281.83 lei
- 20% Preț: 550.25 lei
- Preț: 441.27 lei
- 15% Preț: 581.73 lei
- Preț: 489.81 lei
- Preț: 310.95 lei
- 15% Preț: 572.76 lei
- Preț: 313.22 lei
- 18% Preț: 808.33 lei
Preț: 347.43 lei
Nou
Puncte Express: 521
Preț estimativ în valută:
66.51€ • 69.24$ • 54.76£
66.51€ • 69.24$ • 54.76£
Carte tipărită la comandă
Livrare economică 01-15 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783528067625
ISBN-10: 3528067624
Pagini: 241
Ilustrații: VIII, 241 p. 2 illus.
Dimensiuni: 170 x 240 x 14 mm
Greutate: 0.41 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: Vieweg+Teubner Verlag
Colecția Vieweg+Teubner Verlag
Seria Advanced Lectures in Mathematics
Locul publicării:Wiesbaden, Germany
ISBN-10: 3528067624
Pagini: 241
Ilustrații: VIII, 241 p. 2 illus.
Dimensiuni: 170 x 240 x 14 mm
Greutate: 0.41 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: Vieweg+Teubner Verlag
Colecția Vieweg+Teubner Verlag
Seria Advanced Lectures in Mathematics
Locul publicării:Wiesbaden, Germany
Public țintă
Upper undergraduateCuprins
1 Basics I: Graphs.- 1.1 Introduction to graph theory.- 1.2 Excursion: Random graphs.- 2 Basics II: Algorithms.- 2.1 Introduction to algorithms.- 2.2 Excursion: Fibonacci heaps and amortized time.- 3 Basics III: Complexity.- 3.1 Introduction to complexity theory.- 3.2 Excursion: More NP-complete problems.- 4 Special Terminal Sets.- 4.1 The shortest path problem.- 4.2 The minimum spanning tree problem.- 4.3 Excursion: Matroids and the greedy algorithm.- 5 Exact Algorithms.- 5.1 The enumeration algorithm.- 5.2 The Dreyfus-Wagner algorithm.- 5.3 Excursion: Dynamic programming.- 6 Approximation Algorithms.- 6.1 A simple algorithm with performance ratio 2.- 6.2 Improving the time complexity.- 6.3 Excursion: Machine scheduling.- 7 More on Approximation Algorithms.- 7.1 Minimum spanning trees in hypergraphs.- 7.2 Improving the performance ratio I.- 7.3 Excursion: The complexity of optimization problems.- 8 Randomness Helps.- 8.1 Probabilistic complexity classes.- 8.2 Improving the performance ratio II.- 8.3 An almost always optimal algorithm.- 8.4 Excursion: Primality and cryptography.- 9 Limits of Approximability.- 9.1 Reducing optimization problems.- 9.2 APX-completeness.- 9.3 Excursion: Probabilistically checkable proofs.- 10 Geometric Steiner Problems.- 10.1 A characterization of rectilinear Steiner minimum trees.- 10.2 The Steiner ratios.- 10.3 An almost linear time approximation scheme.- 10.4 Excursion: The Euclidean Steiner problem.- Symbol Index.
Recenzii
"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
"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
Notă biografică
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.
Textul de pe ultima copertă
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.
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.
Caracteristici
Discrete mathematics in relation to computer science