Iterative Methods in Combinatorial Optimization Paperback / softback
by Lap Chi (The Chinese University of Hong Kong) Lau, R. (Carnegie Mellon University, Pennsylvania) Ravi, Mohit (McGill University, Montreal) Singh
Part of the Cambridge Texts in Applied Mathematics series
Paperback / softback
- Information
Description
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.
Information
-
Out of StockMore expected soonContact us for further information
- Format:Paperback / softback
- Pages:256 pages, Worked examples or Exercises; 44 Line drawings, unspecified
- Publisher:Cambridge University Press
- Publication Date:18/04/2011
- Category:
- ISBN:9780521189439
Information
-
Out of StockMore expected soonContact us for further information
- Format:Paperback / softback
- Pages:256 pages, Worked examples or Exercises; 44 Line drawings, unspecified
- Publisher:Cambridge University Press
- Publication Date:18/04/2011
- Category:
- ISBN:9780521189439