The Leading eBooks Store Online

for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...

New to eBooks.com?

Learn more

Spanning Trees and Optimization Problems

Spanning Trees and Optimization Problems
Add to cart
US$ 89.95 (+ tax)
Spanning trees play an important role in the design of efficient routing algorithms and help solve computationally hard problems like the Steiner tree and the traveling salesperson problem. This is one of the most important concepts used in graph theory, as it forms the foundation of many theoretical results in practical fields like scheduling, clustering, data mining, and many others. Spanning Trees and Optimization Problems is the first book published on the use and applications associated with the modern study of spanning trees. It covers properties of spanning trees first, followed by the three categories of spanning trees: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees.
Chapman & Hall/CRC; January 2004
200 pages; ISBN 9780203497289
Read online, or download in secure PDF format or MobiPocket