Lectures on Proof Verification and Approximation Algorithms (Paperback, 1998 ed.)

During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 1367
Release date:	February 1998
First published:	1998
Editors:	Ernst W. Mayr • Hans Jurgen Proemel • Angelika Steger
Dimensions:	235 x 155 x 19mm (L x W x T)
Format:	Paperback
Pages:	348
Edition:	1998 ed.
ISBN-13:	978-3-540-64201-5
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation
LSN:	3-540-64201-3
Barcode:	9783540642015

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!