Steiner tree problems in computer communication networks /
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...
Saved in:
| Online Access: |
Full text (MCPHS users only) |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Singapore ; Hackensack, NJ :
World Scientific,
2008
|
| Subjects: | |
| Local Note: | ProQuest Ebook Central |
| Summary: | 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. |
|---|---|
| Physical Description: | 1 online resource (xiii, 359 pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 337-353) and index. |
| ISBN: | 9812791450 9789812791450 1281933945 9781281933942 9786611933944 6611933948 |
| Language: | English. |
| Source of Description, Etc. Note: | Print version record. |
