Iterative Methods in Combinatorial Optimization (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Texts in Applied Mathematics
Release date:	April 2011
First published:	April 2011
Authors:	Lap-Chi Lau • R. Ravi • Mohit Singh
Dimensions:	229 x 153 x 15mm (L x W x T)
Format:	Paperback - Trade
Pages:	256
ISBN-13:	978-0-521-18943-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Optimization > General Promotions
LSN:	0-521-18943-8
Barcode:	9780521189439

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!