A cool Flash book cover by 蘇辰豫. Yes, it's spanning!!

Spanning Trees and Optimization Problems

By Bang Ye Wu (吳邦一) and Kun-Mao Chao (趙坤茂)

Series: Discrete Mathematics and Its Applications Volume: 26
ISBN: 1584884363
Publication Date: 1/27/2004
Number of Pages: 200

Chapman & Hall / CRC

This book can be found in these libraries (Manual search by ourselves).
Try Worldcat by OCLC at the following link (You'll be able to find in libraries near you.):
    http://worldcatlibraries.org/wcpa/isbn/1584884363

Contents & References

Errata

  • Covers the full spectrum of spanning tree algorithms, with focus on weighted graphs and problems related to optimization
  • Includes many examples and applications from areas such as electrical engineering, bioinformatics, and computer science
  • Reports on some of the authors' recent research, which has opened up a new line of investigation
  • Contains exercises in each chapter

    The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under one cover spanning tree properties, classical results, and recent research developments.

    Spanning Trees and Optimization Problems offers the first complete treatment of spanning tree algorithms, from their role in classical computer science to their most modern applications. The authors first explain the general properties of spanning trees, then focus on three main categories: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees. Along with the theoretical descriptions of the methods, numerous examples and applications illustrate the concepts in practice. The final chapter explores several other interesting spanning trees, including maximum leaf spanning trees, minimum diameter spanning trees, Steiner trees, and evolutionary trees.

    With logical organization, well chosen topics, and easy to understand pseudocode, the authors provide not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. This book will be a welcome addition to your reference shelf whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems
    　
    		•