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.
- ISBN13 9789812791443
- Publish Date 25 February 2008 (first published 1 January 2008)
- Publish Status Active
- Publish Country SG
- Imprint World Scientific Publishing Co Pte Ltd
- Format Hardcover
- Pages 376
- Language English
- URL https://worldscientific.com/worldscibooks/10.1142/6729