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
Rezensionen / Stimmen
"... 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
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Mathematicians; computer scientists; electrical engineers; industrial engineers
Produkt-Hinweis
Illustrationen
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 Klassifikation
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.
