Approximation Algorithms
Publisher: Springer | ISBN: 3540653678 | edition 2001 | PDF | 256 pages | 27,1 mb
Publisher: Springer | ISBN: 3540653678 | edition 2001 | PDF | 256 pages | 27,1 mb
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.
You Might Also Like : Mathematics
