Synopsis
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 becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks
"synopsis" may belong to another edition of this title.
Search results for APPROXIMATION ALGORITHMS
Stock Image
APPROXIMATION ALGORITHMS
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
unknown_binding. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_381050108
Stock Image
APPROXIMATION ALGORITHMS
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
Unknown. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.05. Seller Inventory # G8181283856I5N00
Stock Image
Approximation Algorithms
Seller: Books in my Basket, New Delhi, India
Seller rating 5 out of 5 stars
Soft cover. Condition: New. ISBN:9788181283856. Seller Inventory # 2385792