Newsletter   Secure Checkout   Shopping Cart (0 Items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties [Hardcover]

Our Price $ 111.86  
Retail Value $ 119.00  
You Save $ 7.14  
Item Number 227055  
Buy New $111.86
Quantity:
Available on the Internet only.

Item description for Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela & M. Protasi...

This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.



Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!

Item Specifications...


Pages   524
Est. Packaging Dimensions:   Length: 1.5" Width: 8" Height: 9.75"
Weight:   2.6 lbs.
Binding  Hardcover
Release Date   Feb 1, 2003
Publisher   Springer
ISBN  3540654313  
ISBN13  9783540654315  


Availability  109 units.
Availability accurate as of Jan 24, 2017 08:34.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.


More About G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela & M. Protasi


Register your artisan biography and upload your photo! G. Ausiello was born in 1941.

Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.



Product Categories

1Books > Special Features > New & Used Textbooks > Computer Science & Information Systems
2Books > Special Features > New & Used Textbooks > Sciences > Mathematics > Algebra & Trigonometry
3Books > Subjects > Computers & Internet > Computer Science > Software Engineering > Information Systems
4Books > Subjects > Computers & Internet > Digital Business & Culture > Manager's Guides to Computing
5Books > Subjects > Computers & Internet > General
6Books > Subjects > Computers & Internet > Programming > Algorithms > General
7Books > Subjects > Professional & Technical > Professional Science > Mathematics > Applied > Game Theory
8Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Algebra > General
9Books > Subjects > Reference > General
10Books > Subjects > Science > Mathematics > Applied > Game Theory
11Books > Subjects > Science > Mathematics > General
12Books > Subjects > Science > Mathematics > Pure Mathematics > Algebra > General
13Books > Subjects > Science > Mathematics > Pure Mathematics > Combinatorics



Reviews - What do customers think about Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties?

Complexity book  Aug 24, 2007
The book is excellent for teaching approximation algorithms. The book was new, but I benefit of a reduced price (probably promotional).
 
A great sequel to Garey and Johnson  Mar 30, 2001
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.

 
A great sequel to Garey and Johnson  Mar 29, 2001
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.

 

Write your own review about Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties



Ask A Question or Provide Feedback regarding Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties


Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :



Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!



Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter


Resources
Gift Certificates
RSS Feeds
Corporate
About Us
Contact Us
Policies
Terms Of Use
Privacy Policy