Skip to main content
Book cover

The Steiner Tree Problem

A Tour through Graphs, Algorithms, and Complexity

  • Textbook
  • © 2002

Overview

  • Discrete mathematics in relation to computer science

Part of the book series: Advanced Lectures in Mathematics (ALM)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

Keywords

About this book

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

Reviews

"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

Authors and Affiliations

  • Institut für Informatik, Humboldt Universität zu Berlin, Berlin, Germany

    Hans Jürgen Prömel

  • Institut für Informatik, Technische Universität München, München, Germany

    Angelika Steger

About the authors

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.

Bibliographic Information

  • Book Title: The Steiner Tree Problem

  • Book Subtitle: A Tour through Graphs, Algorithms, and Complexity

  • Authors: Hans Jürgen Prömel, Angelika Steger

  • Series Title: Advanced Lectures in Mathematics

  • DOI: https://doi.org/10.1007/978-3-322-80291-0

  • Publisher: Vieweg+Teubner Verlag Wiesbaden

  • eBook Packages: Springer Book Archive

  • Copyright Information: Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden 2002

  • Softcover ISBN: 978-3-528-06762-5Published: 25 February 2002

  • eBook ISBN: 978-3-322-80291-0Published: 06 December 2012

  • Series ISSN: 0932-7134

  • Series E-ISSN: 2512-7039

  • Edition Number: 1

  • Number of Pages: VIII, 241

  • Number of Illustrations: 2 b/w illustrations

  • Topics: Functions of a Complex Variable, Approximations and Expansions, Algebra

Publish with us