Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh.
"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,...
Saved in:
| Superior document: | Cambridge texts in applied mathematics |
|---|---|
| : | |
| TeilnehmendeR: | |
| Year of Publication: | 2011 |
| Language: | English |
| Series: | Cambridge texts in applied mathematics.
|
| Online Access: | |
| Physical Description: | xi, 242 p. :; ill. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | "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"-- "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"-- |
|---|---|
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9781107007512 (hardback) 9780521189439 (pbk.) 9781139081078 (electronic bk.) |
| Hierarchical level: | Monograph |
| Statement of Responsibility: | Lap Chi Lau, R. Ravi, Mohit Singh. |