Lectures on Proof Verification and Approximation Algorithms (1998) (Lecture Notes in Computer Science #1367)
By: and and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1998
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783540697015
- Related ISBNs:
- 9783540642015
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 07/14/22
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
- Edited by:
- Ernst W. Mayr
- Edited by:
- Hans Jürgen Prömel
- Edited by:
- Angelika Steger
Reviews
Other Books
- by Ernst W. Mayr
- by Hans Jürgen Prömel
- by Angelika Steger
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics