Iterative Methods in Combinatorial Optimization by Mohit Singh
Author: Mohit Singh
Number of Pages: 254 pages
Published Date: 30 Apr 2011
Publisher: CAMBRIDGE UNIVERSITY PRESS
Publication Country: Cambridge, United Kingdom
Language: English
ISBN: 9781107007512
File Name: Iterative.Methods.in.Combinatorial.Optimization.pdf
Download Link: Iterative Methods in Combinatorial Optimization
---------------------------------------------------------------
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.
Read online Iterative Methods in Combinatorial Optimization Buy Iterative Methods in Combinatorial Optimization Download and read Iterative Methods in Combinatorial Optimization ebook, pdf, djvu, epub, mobi, fb2, zip, rar, torrent Download to iPad/iPhone/iOS, B&N nook Iterative Methods in Combinatorial Optimization ebook, pdf, djvu, epub, mobi, fb2, zip, rar, torrent