English
LOOKING TO PLACE A BULK ORDER?CLICK HERE
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
About The Book
Description
Author(s)
Discrete optimization problems are everywhere from traditional operations research planning problems such as scheduling facility location and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The
Available Coupons
Coupons redeemable on this product:
Details
ISBN 13
9780521195270
Publication Date
-16-06-2011
Pages
-518
Weight
-1016 grams
Dimensions
-178x254x28.61 mm
Imprint
-Cambridge University Press UK
Details
ISBN 13
:
9780521195270
Publication Date
:
16-06-2011
Pages
:
518
Weight
:
1016 grams
Dimensions
:
178x254x28.61 mm
Imprint
:
Cambridge University Press UK
Publisher
Ratings & Reviews
No reviews added yet.
