Format:
1 Online-Ressource (xi, 242 pages)
,
digital, PDF file(s)
ISBN:
9780511977152
Series Statement:
Cambridge texts in applied mathematics 46
Content:
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
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Additional Edition:
ISBN 9781107007512
Additional Edition:
ISBN 9780521189439
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9781107007512
Language:
English
DOI:
10.1017/CBO9780511977152
