Industrial-Sized Deals TextBTS15 Shop Men's Hightops Learn more nav_sap_SWP_6M_fly_beacon Cecile McLorin Salvant UP3 $5 Off Fire TV Stick Subscribe & Save Shop Popular Services hog hog hog  Amazon Echo Starting at $99 Kindle Voyage Labor Day Savings with Amazon Outdoor Recreation Learn more

Approximation Algorithms for NP-Hard Problems 1st Edition

1 customer review
ISBN-13: 978-0534949686
ISBN-10: 0534949681
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Sell yours for a Gift Card
We'll buy it for $2.25
Learn More
Trade in now
Have one to sell? Sell on Amazon
More Buying Choices
9 New from $99.99 18 Used from $43.20

InterDesign Brand Store Awareness Rent Textbooks


Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details

  • Hardcover: 624 pages
  • Publisher: Course Technology; 1 edition (July 26, 1996)
  • Language: English
  • ISBN-10: 0534949681
  • ISBN-13: 978-0534949686
  • Product Dimensions: 9.6 x 6.6 x 1.2 inches
  • Shipping Weight: 2 pounds
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #1,636,210 in Books (See Top 100 in Books)

Customer Reviews

5 star
4 star
3 star
2 star
1 star
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

22 of 28 people found the following review helpful By KARTIK KRISHNAN S. on May 9, 2000
Format: Hardcover
Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. This book is actually a collection of survey articles written by some of the foremost experts in this field.
Many of these developments are due to Mathemtical programming (primal dual, semidefinite programming et al). The most exciting of these has been the Goemans and Williamson algorithm for MAX CUT and MAX SAT. A good account of these techniques appears in Chapters 4 and 11.
On the other hand a sequence of unexpected results in complexity culminated in a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. A good survey of "Hardness of Approximations" appears in Chapter 10, written by Sanjeev Arora and Carsten Lund both of whom were responsible for some original developments in this field.
I am going to purchase a copy of this book and can only strongly recommend it to everyone.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Want to discover more products? Check out this page to see more: algorithm np