The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
Spanning Trees and Optimization Problems
US$ 104.95
(+ tax)
Preview (read now)
Add to my own site
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: secure PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
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 less
Taylor and Francis; January 2004
200 pages; ISBN 9781135437039
Read online, or download in secure PDF format
200 pages; ISBN 9781135437039
Read online, or download in secure PDF format
Subject categories
- Academic > Mathematics > Algebra > Graph theory
- Academic > Mathematics > Algebra > Trees (Graph theory); Data processing; Congresses
- Academic > Mathematics > General > Vinogradov, Ivan Matveevich, 1891-
- Academic > Mathematics > General > Mathematics; Periodicals
- Academic > Mathematics > General > Mathematics; Study and teaching
- Computers > Operating Systems
- Computers > Programming
- Technology > Electronics
- Mathematics
ISBNs
0203497287
9780203497289
9781135437022
9781135437039
9781584884361