

| Publisher | Springer |
| ISBN 10 | 3540642013 |
| Author | Ernst W. Mayr |
| Publication Date | 25 February 1998 |
| ISBN 13 | 9783540642015 |
| Book Description | 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. |
| Language | English |
| Number of Pages | 364 pages |

We're Always Here To Help
Reach out to us through any of these support channels
Electronics
MobilesTabletsLaptopsHome AppliancesCamera, Photo & VideoTelevisionsHeadphonesVideo GamesFashion
Women's FashionMen's FashionGirls' FashionBoys' FashionWatchesJewelleryWomen's HandbagsMen's EyewearHome and Kitchen
BathHome DecorKitchen & DiningTools & Home ImprovementBeddingFurniturePatio, Lawn & GardenPet SuppliesBeauty
FragranceMake-UpHaircareSkincareBath & BodyElectronic Beauty ToolsMen's GroomingHealth Care Essentials