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 problemsThus the vertices of degree one, i.e., the leaves, in T are those that do not appear in P. To reconstruct T from (p1, p2, ..., pn?2), we proceed as follows. Let V be the vertex label set {1, 2, ..., n}. In the ith iteration of the for loop, P=(pi, pi+1, ..., pn?2)anbsp;...

Title | : | Spanning Trees and Optimization Problems |

Author | : | Bang Ye Wu, Kun-Mao Chao |

Publisher | : | CRC Press - 2004-01-27 |

Continue