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.
Acquista questo ebook e ricevine 1 in più GRATIS!
Lingua Inglese ● Formato PDF ● ISBN 9783540697015 ● Editore Ernst W. Mayr & Hans Jurgen Promel ● Casa editrice Springer Berlin Heidelberg ● Pubblicato 2006 ● Scaricabile 3 volte ● Moneta EUR ● ID 6319825 ● Protezione dalla copia Adobe DRM
Richiede un lettore di ebook compatibile con DRM