With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Table of Contents:
3. Matching and vertex cover in bipartite graphs
4. Spanning trees
6. Arborescence and rooted connectivity
7. Submodular flows and applications
8. Network matrices
10. Network design
11. Constrained optimization problems
12. Cut problems
13. Iterative relaxation: early and recent examples
The book summary and image may be of a different edition or binding of the same title.
Book reviews are added by registered customers. They need not necessarily buy book.
These books are NOT available for reading online or for free download in PDF or ebook format.
Price can change due to reprinting, price change by publisher or sourcing cost change for imported books.
www.infibeam.com/Books is the biggest online bookstore in India for sale of books at best price - fiction, literature, audiobooks, study guides, novels,
story books, rare books, textbooks and books by popular authors. These are available in various editions and bindings e.g. paperback and at best discount.