The No1 Ethical retailer for Books, CD’s, DVD’s & Games
30 Day Refund Guarantee

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

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

by Martin Aigner (Editor), Angelika Steger (Author), Hans-JuergenProemel (Author), Hans-JurgenPromel (Author)

  • New

    Paperback 1996

    $42.12
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.

$42.12

Quantity

10 in stock

More Information

Format: Paperback
 Pages: 241
 Publisher: Friedrich Vieweg & Sohn Verlagsgesellschaft mbH
Published: Aug 1996
ISBN 10: 3528067624
ISBN 13: 9783528067625
Book Overview: Discrete mathematics in relation to computer science

Media 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
Author Bio
Prof. Dr. Jurgen Promel ist am Institut fur Informatik der Humboldt Universitat zu Berlin tatig, Prof. Dr. Angelika Steger lehrt am Institut fur Informatik der TU Munchen.