|
|
|
Spanning Trees and
Optimization Problems Bang Ye Wu and Kun-Mao Chao
|
|
|
Mathematics The design of
approximation algorithms for spanning tree problems has become an 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 the most modern
applications. It explains the general properties of spanning trees, then focuses on three main categories: minimum spanning
trees, shortest-paths trees, and minimum routing cost spanning trees. The
final chapter explores several other interesting spanning trees, including
maximum diameter spanning trees, Steiner trees, and evolutionary trees. With logical
organization, well-chosen topics, and easy-to-understand pseudocode,
this book is not only a full, rigorous treatment of theory and applications,
but also an excellent handbook for spanning tree algorithms. It 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. Features
weighted graphs and
problems related to optimization
Bang Ye Wu is an Assistant
Professor in the Department of Computer Science and Information Engineering, Shu-Te University, Taiwan Kun-Mao Chao is a Professor in the Department of Computer Science and
Information Engineering, |
|
|
|
|
