
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.
This book investigates significant advancements in the Steiner tree problem, a fundamental combinatorial optimization challenge with roots in Fermat's work. It focuses on three major breakthroughs from the 1990s and explores key applications within computer communication networks developed over the last fifteen years, offering a blend of theoretical methods and practical considerations.
The book is positioned as a comprehensive study of the Steiner tree problem, highlighting its historical significance and recent developments. Its focus on specific breakthroughs and applications suggests it aims to provide both theoretical depth and practical relevance for researchers and practitioners in computer science and network optimization. The blend of historical context and contemporary applications indicates a structured approach to understanding this complex optimization problem.
Page Count:
376
Publication Date:
2008-02-20
Publisher:
World Scientific
ISBN-10:
9814471895
ISBN-13:
9789814471893
No comments yet. Be the first to share your thoughts!