Description: Complexity and Approximation by Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi Estimated delivery 3-12 business days Format Hardcover Condition Brand New Description , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. Publisher Description 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. Details ISBN 3540654313 ISBN-13 9783540654315 Title Complexity and Approximation Author Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi Format Hardcover Year 1999 Pages 524 Edition 1st Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG GE_Item_ID:158891270; About Us Grand Eagle Retail is the ideal place for all your shopping needs! With fast shipping, low prices, friendly service and over 1,000,000 in stock items - you're bound to find what you want, at a price you'll love! Shipping & Delivery Times Shipping is FREE to any address in USA. Please view eBay estimated delivery times at the top of the listing. Deliveries are made by either USPS or Courier. We are unable to deliver faster than stated. International deliveries will take 1-6 weeks. NOTE: We are unable to offer combined shipping for multiple items purchased. This is because our items are shipped from different locations. Returns If you wish to return an item, please consult our Returns Policy as below: Please contact Customer Services and request "Return Authorisation" before you send your item back to us. Unauthorised returns will not be accepted. Returns must be postmarked within 4 business days of authorisation and must be in resellable condition. Returns are shipped at the customer's risk. We cannot take responsibility for items which are lost or damaged in transit. For purchases where a shipping charge was paid, there will be no refund of the original shipping charge. Additional Questions If you have any questions please feel free to Contact Us. Categories Baby Books Electronics Fashion Games Health & Beauty Home, Garden & Pets Movies Music Sports & Outdoors Toys
Price: 136.42 USD
Location: Fairfield, Ohio
End Time: 2024-11-23T03:30:54.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
ISBN-13: 9783540654315
Book Title: Complexity and Approximation
Number of Pages: Xx, 524 Pages
Publication Name: Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Language: English
Publisher: Springer Berlin / Heidelberg
Item Height: 0.6 in
Subject: Programming / General, Programming / Algorithms, Numerical Analysis
Publication Year: 1999
Type: Textbook
Item Weight: 48.7 Oz
Subject Area: Mathematics, Computers
Author: P. Crescenzi, G. Gambosi, V. Kann, G. Ausiello, A. Marchetti-Spaccamela
Item Length: 10 in
Item Width: 8 in
Format: Hardcover
