We strive to deliver the best value to our customers and ensure complete satisfaction for all our textbook rentals.
You can return your online books for any reason within our refund period – no questions asked.
Every order is available for express shipping, and return shipping is always free.
You'll be happy with the quality of your books (or we'll ship you another one on our dime).
You can extend your rental at any time – at the same cheap daily rental rate.
If you decide to keep the book it will never cost more than the purchase price.
As always, you have access to over 5 million titles. Plus, you can choose from 5 rental periods, so you only pay for what you’ll use. And if you ever run into trouble, our top-notch U.S. based Customer Service team is ready to help by email, chat or phone.
Supplemental materials are not guaranteed for used textbooks or rentals (access codes, DVDs, workbooks).
Spanning Trees and Optimization Problems (Discrete Mathematics and Its Applications)
by:Bang Ye Wu, Kun-Mao Chao
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...
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
Since launching the first textbook rental site in 2006, BookRenter has never wavered from our mission to make education more affordable for all students. Every day, we focus on delivering students the best prices, the most flexible options, and the best service on earth. On March 13, 2012 BookRenter.com, Inc. formally changed its name to Rafter, Inc. We are still the same company and the same people, only our corporate name has changed.