Spanning Trees and Optimization Problems

by Bang Ye Wu, Kun-Mao Chao

Overview

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

Product Details

ISBN-13:	9781135437022
Publisher:	CRC Press
Publication date:	01/27/2004
Series:	Discrete Mathematics and Its Applications
Sold by:	Barnes & Noble
Format:	eBook
Pages:	200
File size:	5 MB

About the Author

Wu\, Bang Ye; Chao\, Kun-Mao

Table of Contents

Introduction. Minimum Spanning Trees. Shortest-Paths Trees. Minimum Routing Cost Spanning Trees. Optimal Communication Spanning Trees. Balancing the Tree Costs. Steiner Trees and Some Other Problems.

Editorial Reviews

"… 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

From the Publisher