Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008996801/catalog> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b12645131.
- catalog contributor b12645132.
- catalog created "c2002.".
- catalog date "2002".
- catalog date "c2002.".
- catalog dateCopyrighted "c2002.".
- catalog description "1. Basics I: Graphs -- 2. Basics II: Algorithms -- 3. Basics III: Complexity -- 4. Special Terminal Sets -- 5. Exact Algorithms -- 6. Approximations Algorithms -- 7. More on Approximation Algorithms -- 8. Randomness Helps -- 9. Limits of Approximability -- 10. Geometric Steiner Problems.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. 223-231) and indexes.".
- catalog extent "viii, 241 p. :".
- catalog identifier "3528067624".
- catalog isPartOf "Advanced lectures in mathematics, 0932-7134".
- catalog issued "2002".
- catalog issued "c2002.".
- catalog language "eng".
- catalog publisher "Braunschweig : Vieweg,".
- catalog subject "Algebra.".
- catalog subject "Algorithms.".
- catalog subject "Computational complexity.".
- catalog subject "Graph theory.".
- catalog subject "Mathematics.".
- catalog subject "QA166.3 .P76 2002".
- catalog subject "Steiner systems.".
- catalog tableOfContents "1. Basics I: Graphs -- 2. Basics II: Algorithms -- 3. Basics III: Complexity -- 4. Special Terminal Sets -- 5. Exact Algorithms -- 6. Approximations Algorithms -- 7. More on Approximation Algorithms -- 8. Randomness Helps -- 9. Limits of Approximability -- 10. Geometric Steiner Problems.".
- catalog title "The Steiner tree problem : a tour through graphs, algorithms, and complexity / Hans Jürgen Prömel, Angelika Steger.".
- catalog type "text".