/LC.GIF&client=easterncarolinaedu)
Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh.
| Author/creator | Lau, Lap Chi |
| Other author | Ravi, R. (Ramamoorthi), 1969- |
| Other author | Singh, Mohit. |
| Format | Electronic |
| Publication Info | Cambridge ; New York : Cambridge University Press, |
| Description | xi, 242 p. : ill. ; 24 cm. |
| Supplemental Content | Full text available from Ebook Central - Academic Complete |
| Subjects |
| Series | Cambridge texts in applied mathematics Cambridge texts in applied mathematics. ^A237667 |
| Abstract | "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"-- Provided by publisher. |
| Abstract | "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"-- Provided by publisher. |
| Bibliography note | Includes bibliographical references and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2011003653 |
| ISBN | 9781107007512 (hardback) |
| ISBN | 1107007518 (hardback) |
| ISBN | 9780521189439 (pbk.) |
| ISBN | 0521189438 (pbk.) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | Access Content Online | ✔ Available |