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

✍ Scribed by Hans Jürgen Prömel, Angelika Steger

Publisher: Vieweg+Teubner Verlag
Year: 2002
Tongue: English
Leaves: 250
Series: Advanced Lectures in Mathematics
Edition: Softcover reprint of the original 1st ed. 2002
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The Steiner Tree Problem: A Tour through

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

✍ Prof. Dr. Hans Jürgen Prömel, Prof. Dr. Angelika Steger (auth.) 📂 Library 📅 2002 🏛 Vieweg+Teubner Verlag 🌐 English

<p>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 spe

Advances in Steiner Trees

📁 Advances in Steiner Trees

✍ J.H. Rubinstein 📂 Library 📅 2000 🏛 Springer 🌐 English

The Steiner ratio of finite-dimensional Lp spaces / J. Albrecht and D. Cieslik -- Shortest networks for one line and two points in space / R. Booth, D.A. Thomas, and J.F. Weng -- Rectilinear Steiner minimal trees on parallel lines / M. Brazil, D. Thomas, and J. Weng -- Computing shortest networks w

Advances in Steiner Trees

📁 Advances in Steiner Trees

✍ Jens Albrecht, Dietmar Cieslik (auth.), Ding-Zhu Du, J. M. Smith, J. H. Rubinste 📂 Library 📅 2000 🏛 Springer US 🌐 English

<p>The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geomet

Graphs, Networks and Algorithms (Algorit

📁 Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

✍ Dieter Jungnickel 📂 Library 📅 2007 🏛 Springer 🌐 English

This is the definitive guide to graph algorithms. Every algorithm is well documented with proofs and complexity estimates. A general knowledge of graph theory is presupposed. This is a very good thing, since then neither paper or time needs to be vasted on elementaries. There are heaps of introd

Graphs, Networks and Algorithms (Algorit

📁 Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

✍ Dieter Jungnickel 📂 Library 📅 2007 🏛 Springer 🌐 English

Graphs, Networks and Algorithms (Algorit

📁 Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

✍ Dieter Jungnickel 📂 Library 📅 2007 🏛 Springer 🌐 English

Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed