Stock image for illustration purposes only - book cover, edition or condition may vary.
Approximation Algorithms
Vijay V. Vazirani
€ 118.95
FREE Delivery in Ireland
Description for Approximation Algorithms
Hardcover. Covers theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. This book contains useful algorithms and results about the intrinsic complexity of combinatorial problems. It is of interest to theoretical computer scientists, operations researchers, and discrete mathematicians. Num Pages: 380 pages, biography. BIC Classification: UMB; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 239 x 162 x 29. Weight in Grams: 740.
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 ... Read more
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 ... Read more
Product Details
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
399
Format
Hardback
Publication date
2004
Condition
New
Weight
739g
Number of Pages
380
Place of Publication
Berlin, Germany
ISBN
9783540653677
SKU
V9783540653677
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Approximation Algorithms
From the reviews: "Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly ... Read more