Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Hackensack, NJ :
World Scientific,
©2008.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 online resource (xiii, 359 pages) : illustrations |
| Bibliografía: | Includes bibliographical references (pages 337-353) and index. |
| ISBN: | 9789812791450 9812791450 9812791442 9789812791443 1281933945 9781281933942 |