Spanning Trees and Optimization Problems
Regular price
€173.60
14 days return policy
Shipping & Delivery
A01=Bang Ye Wu
A01=Kun-Mao Chao
advanced algorithm design
algorithm
approximation algorithms for routing cost problems
Approximation Ratio
Author_Bang Ye Wu
Author_Kun-Mao Chao
Bellman Ford Algorithm
Category=PBV
combinatorial optimization
computational biology applications
Dijkstra's Algorithm
Dijkstra’s Algorithm
discrete mathematics methods
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Eulerian Cycle
evolutionary tree analysis
graph theory algorithms
kruskal's
label
Leafy Trees
lowest
minimum
Minimum Routing Cost
Mst
Mst Problem
Negative Weight Edges
Nonterminal Vertices
prim's
Prim's Algorithm
Prim’s Algorithm
Pseudo-polynomial Time Algorithm
Routing Cost
Routing Load
salesperson
Shortest Paths Tree
Spanning Tree
SPG.
steiner
Steiner Minimal Tree
Steiner Tree
Total Edge Weight
Total Time Complexity
traveling
Ultrametric Tree
Undirected Graph
vertex
Vertex Weight
Vice Versa
Product details
- ISBN 9781584884361
- Weight: 417g
- Dimensions: 156 x 234mm
- Publication Date: 27 Jan 2004
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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
Wu\, Bang Ye; Chao\, Kun-Mao
