Advances in Steiner trees / edited by Ding-Zhu Du, J.M. Smith, and J.H. Rubinstein.
This book presents an up-to-date set of contributions by the most influential authors on the Steiner Tree problem. The authors address the latest concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Other Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
Dordrecht ; Boston :
Kluwer Academic Publishers,
[2000]
|
| Series: | Combinatorial optimization ;
v. 6. |
| Subjects: |
| Summary: | This book presents an up-to-date set of contributions by the most influential authors on the Steiner Tree problem. The authors address the latest concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. Audience: The book is intended for advanced undergraduates, graduates and research scientists in Combinational Optimization and Computer Science. It is divided into two sections: Part I includes papers on the general geometric Steiner Tree problem in the plane and higher dimensions; Part II includes papers on the Steiner problem on graphs which has significant import to Steiner Tree applications. |
|---|---|
| Physical Description: | 1 online resource (xii, 323 pages) : illustrations. |
| Bibliography: | Includes bibliographical references. |
| ISBN: | 9781475731712 147573171X |
| Source of Description, Etc. Note: | Source of description: Print version record. |