Book Details
Format
Paperback / Softback
ISBN-10
3642084699
ISBN-13
9783642084690
Edition
Softcover reprint of hardcover 1st ed. 2001
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Dec 8th, 2010
Print length
380 Pages
Weight
622 grams
Dimensions
15.90 x 23.50 x 1.90 cms
Ksh 10,250.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory;
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
Get Approximation Algorithms by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG and it has pages.
