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 ...
Read More
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.
Read Less
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $58.09, good condition, Sold by ZBK Books rated 5.0 out of 5 stars, ships from Woodland Park, NJ, UNITED STATES, published 1996 by Course Technology.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Used book in good and clean conditions. Pages and cover are intact. Limited notes marks and highlighting may be present. May show signs of normal shelf wear and bends on edges. Item may be missing CDs or access codes. May include library marks. Fast Shipping.
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $59.08, very good condition, Sold by ThriftBooks-Reno rated 5.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published 1996 by Course Technology.
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $63.08, very good condition, Sold by Solr Books rated 4.0 out of 5 stars, ships from Lincolnwood, IL, UNITED STATES, published 1996 by Course Technology.
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $70.91, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1996 by Course Technology.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $108.88, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Course Technology.
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $144.13, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Course Technology.
Add this copy of Approximation Algorithms for Np-Hard Problems to cart. $176.40, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1996 by Course Technology.
