Spanning Trees and Optimization Problems
1st Edition
Published on 27. January 2004
200 pages
978-1-135-43702-2 (ISBN)
Description
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
Reviews / Votes
"... 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
More details
Series
Edition
1. Auflage
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Mathematicians; computer scientists; electrical engineers; industrial engineers
Product notice
Reflowable
Illustrations
67 s/w Abbildungen, 1 s/w Tabelle
67 b/w images, 1 table and 100 equations
ISBN-13
978-1-135-43702-2 (9781135437022)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Bang Ye Wu | Kun-Mao Chao
Spanning Trees and Optimization Problems
Book
01/2004
1st Edition
Chapman & Hall/CRC
€193.13
Article not available at the moment
Persons
Content
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.
