Approximation algorithms Springer-verlag berlin and heidelberg gmbh & co. kg (Springer-Verlag Berlin and Heidelberg GmbH & Co. KG)

Approximation algorithms are currently a central and fast-developing area of research in theoretical computer science. This monograph covers the basic techniques used in the latest research work, techniques that everyone in the field should know, and shows that they form the beginnings of a promising theory. The author consolidates progress made so far, including some very recent results, and makes a strong effort to convey the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, he writes algorithms in simple English to make them easy to understand, and he provides critical examples and numerous illustrations to help in elucidating the algorithms. Many of the results presented have been simplified and new insights provided. The book will interest theoretical computer scientists, operations researchers, and discrete mathematicians.