Approximation Algorithms

by Vijay V. Vazirani

Book Overview

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con- jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore...

• Format: Paperback
• Language: English
• ISBN: 3642084699
• ISBN13: 9783642084690
• Release Date: December 2010
• Publisher: Springer
• Length: 380 Pages
• Weight: 1.24 lbs.
• Dimensions: 0.8" x 6.1" x 9.2"