| 书目名称 | Lectures on Proof Verification and Approximation Algorithms |
| 编辑 | Ernst W. Mayr,Hans Jürgen Prömel,Angelika Steger |
| 视频video | |
| 概述 | This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years..Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | 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. |
| 出版日期 | Textbook 1998 |
| 关键词 | algorithm; algorithms; approximation algorithms; complexity; complexity theory; optimization; programming; |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0053010 |
| isbn_softcover | 978-3-540-64201-5 |
| isbn_ebook | 978-3-540-69701-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1998 |
发表于 2025-3-21 17:13:42
