About this title: 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 ...
read more
Note: This is a general synopsis. Each listing is described below.
Binding: Paperback
Publisher: Springer
Date Published: 1998
ISBN-13:9783540642015ISBN:3540642013
Description: New. **** GREAT CONDITION **** *** CLEAN BOOK *** NO HIGHLIGHTS *** NO MARKINGS *** EXPEDITED SHIPPING AVAILABLE *** Excellent condition *** No highlighting *** Shipped promptly *** Great customer service *** read more
Binding: Paperback
Publisher: Springer Verlag
Date Published: 1998
ISBN-13:9783540642015ISBN:3540642013
Description: Very Good. 3540642013. Bookplate, some wear to covers, otherwise text clean and solid; Lecture Notes in Computer Science; Vol. 1367; 344 pages. read more
Binding: Paperback
Publisher: Springer
Date Published: 1998
ISBN-13:9783540642015ISBN:3540642013
Description: New. BRAND NEW and ready for dispatch. Delivery normally within 4/7 days. Our reputation is built on our Speedy Delivery Service and our Customer Service Team. read more
Binding: Paperback
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG Country = GERMANY
Date Published: 1998
ISBN-13:9783540642015ISBN:3540642013
Description: BRAND NEW PAPERBACK. 356 pages. This book is printed on demand (allow 1-2 weeks for printing) a self-contained presentation of progress facilitated by the interplay between the theory of probabilistically checkable proofs and approximation algorithms. the basic concepts, methods and results are designed to provide a smooth introduction for newcomers. illustrations (Paperback) read more
Description: Very Good. 3540642013 Very Good ex-academic library copy nicely rebound as sturdy hardcover, preserving original covers; usual minor library marks and discard rubber stamps; interior is very clean and intact with no marks; binding straight; covers very clean and intact. read more
Binding: Paperback
Publisher: SPRINGER VERLAG GMBH
Date Published: 1998
ISBN-13:9783540642015ISBN:3540642013
Description: New. 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-li... read more
Binding: Paperback
Publisher: Springer
Date Published: 2007
ISBN-13:9783540642015ISBN:3540642013
Description: A self-contained presentation of progress facilitated by the interplay between the theory of probabilistically checkable proofs and approximation algorithms. The basic concepts, methods and results are designed to provide a smooth introduction for new... read more
Description: New. PLEASE NOTE: All books are promptly imported from the UK using DHL or Royal Mail international mail WITH TRACKING NUMBER. Print on demand title. D elivery is typically 5-10 working days. Please do not select expedited shipping. Professional and reliable bookseller (est.1987). read more
Description: New. PLEASE NOTE: All books are promptly shipped from our UK warehouse using Royal Mail or DHL. International Priority mail for non-UK deliveries. Print on demand title. Delivery is typically 3-5 working days for UK delivery. Heavier or more expensive books are shipped with a TRACKING NUMBER. Professional and reliable bookseller (est.1987). read more
We guarantee every item's condition, as described on Alibris. If you are not satisfied that an item is as described, return your purchase for a refund.
