This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.

"About this title" may belong to another edition of this title.

Store Description

Since 2010, the Book Forest has raised over 3 million dollars for participating public libraries.

Visit Seller's Storefront

Seller's business information

Sale & Shipping Terms

Terms of Sale

Shipping Terms

Orders ship within 24 hours of receipt. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or over sized, we may contact you to let you know extra shipping is required.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 14 business days	3 to 6 business days
First item	US$ 4.99	US$ 8.99

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.