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.
€57.99
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप PDF ● ISBN 9783540697015 ● संपादक Ernst W. Mayr & Hans Jurgen Promel ● प्रकाशक Springer Berlin Heidelberg ● प्रकाशित 2006 ● डाउनलोड करने योग्य 3 बार ● मुद्रा EUR ● आईडी 6319825 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
16,795 इस श्रेणी में ईबुक
