登入
選單
返回
Google圖書搜尋
Lectures on Proof Verification and Approximation Algorithms
Ernst W. Mayr
Hans Jürgen Prömel
Angelika Steger
出版
Springer Science & Business Media
, 1998-02-25
主題
Computers / Artificial Intelligence / General
Computers / Computer Science
Computers / Data Science / General
Computers / Information Technology
Computers / Machine Theory
Computers / Programming / Algorithms
Computers / User Interfaces
Mathematics / Calculus
Mathematics / Discrete Mathematics
Mathematics / Logic
Mathematics / Combinatorics
Mathematics / Functional Analysis
Mathematics / Optimization
ISBN
3540642013
9783540642015
URL
http://books.google.com.hk/books?id=_C8Ly1ya4cgC&hl=&source=gbs_api
EBook
SAMPLE
註釋
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.