FREE Delivery in the UK.
Only 1 left in stock.
Dispatched from and sold by Amazon. Gift-wrap available.
Complexity and Approximat... has been added to your Basket
+ £2.80 UK delivery
Used: Good | Details
Condition: Used: Good
Comment: Ships from USA. Please allow 2 to 3 weeks for delivery. Light shelf wear and minimal interior marks. A tradition of quality and service.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties Hardcover – 3 Dec 2002


See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
"Please retry"
£76.50
£60.61 £43.64
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more
£76.50 FREE Delivery in the UK. Only 1 left in stock. Dispatched from and sold by Amazon. Gift-wrap available.

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your e-mail address or mobile phone number.




Product details


More About the Authors

Discover books, learn about writers, and more.

Inside This Book

(Learn More)
First Sentence
IN INTRODUCTORY computer programming courses we learn that computers are used to execute algorithms for the solution of problems. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: HASH(0x93c62888) out of 5 stars 4 reviews
15 of 16 people found the following review helpful
HASH(0x93c8ad2c) out of 5 stars A great sequel to Garey and Johnson 29 Mar. 2001
By KARTIK KRISHNAN S. - Published on Amazon.com
Format: Hardcover
This book is a great sequel to Garey and Johnson. The appendix of this book gives a list of all NP optimisation problems together with their current approximability (or inapproximability results) in a Garey Johnson fashion.
Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. There have been a number of exciting developments like semidefinite programming , the Goemans Williamson algorithm for max cut et al.
On the other hand, from a theoretical computer science point of view, we now have a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP.
This book provides an excellent introduction to both areas. A worthy supplement to Garey and Johnson, Papadimitriou's books on combinatorial optimisation and computational complexity, Hochbaum's book on approximation algorithms, Alon and Spencer's book on the probabilistic method and finally Motwani and Raghavan's book on randomised algorithms.
1 of 1 people found the following review helpful
HASH(0x94b0fcc0) out of 5 stars A great sequel to Garey and Johnson 29 Mar. 2001
By KARTIK KRISHNAN S. - Published on Amazon.com
Format: Hardcover
This book is a great sequel to Garey and Johnson. The appendix of this book gives a list of all NP optimisation problems together with their current approximability (or inapproximability results) in a Garey Johnson fashion.
Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. There have been a number of exciting developments like semidefinite programming , the Goemans Williamson algorithm for max cut et al.
On the other hand, from a theoretical computer science point of view, we now have a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP.
This book provides an excellent introduction to both areas. A worthy supplement to Garey and Johnson, Papadimitriou's books on combinatorial optimisation and computational complexity, Hochbaum's book on approximation algorithms, Alon and Spencer's book on the probabilistic method and finally Motwani and Raghavan's book on randomised algorithms.
HASH(0x954edc90) out of 5 stars Not the best 3 Dec. 2013
By Rapid Logic - Published on Amazon.com
Format: Hardcover Verified Purchase
The two textbooks we used most in my recent approximation algorithms class were this and Vazirani.

If I had to do the course over again, I would read the first three chapters from this book and then stick to Vazirani, relying on this book rarely and only as a supplement.

I recall the notation at times being poorly-chosen. Many of the proofs are much longer than they need to be. If you are assigned this book, make sure you compare Vazirani as you begin each problem and decide from which book you would rather study the approximation algorithm.
0 of 2 people found the following review helpful
HASH(0xa674a4b0) out of 5 stars Complexity book 24 Aug. 2007
By Wolfgang Bein - Published on Amazon.com
Format: Hardcover
The book is excellent for teaching approximation algorithms. The book was new, but I benefit of a reduced price (probably promotional).
Were these reviews helpful? Let us know


Feedback