200 Pages
67 B/W Illustrations
by
Chapman & Hall
200 Pages
by
Chapman & Hall
Also available as eBook on:
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... Read more
SPANNING TREES
Counting Spanning Trees
MINIMUM SPANNING TREES
Introduction
Bor°uvka's Algorithm
Prim's Algorithm
Kruskal's Algorithm
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
SHORTEST-PATHS TREES
Introduction
Dijkstra's Algorithm
The Bellman-Ford Algorithm
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
MINIMUM ROUTING COST SPANNING TREES
Introduction
Approximating by a Shortest-Paths Tree
Approximating by a General Star
A Reduction to the Metric Case
A Polynomial Time Approximation Scheme
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
OPTIMAL COMMUNICATION SPANNING TREES
Introduction
Product-Requirement
Sum-Requirement
Multiple Sources
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
BALANCING THE TREE COSTS
Introduction
Light Approximate Shortest-Paths Trees
Light Approximate Routing Cost Spanning Trees
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
STEINER TREES AND SOME OTHER PROBLEMS
Steiner Minimal Trees
Trees and Diameters
Maximum Leaf Spanning Trees
Some Other Problems
Bibliographic Notes and Further Reading
Exercises
REFERENCES
INDEX
Counting Spanning Trees
MINIMUM SPANNING TREES
Introduction
Bor°uvka's Algorithm
Prim's Algorithm
Kruskal's Algorithm
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
SHORTEST-PATHS TREES
Introduction
Dijkstra's Algorithm
The Bellman-Ford Algorithm
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
MINIMUM ROUTING COST SPANNING TREES
Introduction
Approximating by a Shortest-Paths Tree
Approximating by a General Star
A Reduction to the Metric Case
A Polynomial Time Approximation Scheme
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
OPTIMAL COMMUNICATION SPANNING TREES
Introduction
Product-Requirement
Sum-Requirement
Multiple Sources
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
BALANCING THE TREE COSTS
Introduction
Light Approximate Shortest-Paths Trees
Light Approximate Routing Cost Spanning Trees
Applications
Summary
Bibliographic Notes and Further Reading
Exercises
STEINER TREES AND SOME OTHER PROBLEMS
Steiner Minimal Trees
Trees and Diameters
Maximum Leaf Spanning Trees
Some Other Problems
Bibliographic Notes and Further Reading
Exercises
REFERENCES
INDEX
Biography
Wu\, Bang Ye; Chao\, Kun-Mao
"… will supplement nicely undergraduate courses in discrete mathematics and graph theory … Summing Up: … Recommended for upper-division undergraduates through faculty."
- CHOICE, November 2004, Vol. 42, No. 3
