Item description for Lectures on Proof Verification and Approximation Algorithms (Lecture Notes in Computer Science) by Ernst W. Mayr...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.44" Width: 6.32" Height: 0.8" Weight: 1.1 lbs.
Release Date Apr 8, 1998
ISBN 3540642013 ISBN13 9783540642015
Availability 91 units. Availability accurate as of May 24, 2017 02:30.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.