{"product_id":"9783540642015","title":"Lecture Notes in Computer Science","description":"\u003ch1\u003eLecture Notes in Computer Science\u003c\/h1\u003e \u003ch2\u003eMayr, Ernst W.; Prömel, Hans Jürgen; Steger, Angelika\u003c\/h2\u003e \u003cp\u003eDuring 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 1998-02-25\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783540642015\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/BFb0053010\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 348\u003c\/p\u003e ","brand":"Springer Berlin Heidelberg","offers":[{"title":"Default Title","offer_id":45370085408908,"sku":"9783540642015","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783540642015.jpg?v=1773970240","url":"https:\/\/lateknightbooks.com\/products\/9783540642015","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}