Approximation Algorithms

eBook Information

Approximation Algorithms ISBN  3540653678 Release Date  09 August 2001 Category  Algorithms Tags  algorithm,   algorithms,   approximation,   approximation algorithms,   vazirani,   approx,   3540653678,   genetic algorithms,   "approximation algorithms",   genetic algorithm,   algorithm analysis,   algorithms in c,   randomized algorithms,   iran,   algo,   approximation algorithm,   approximation algorithms,   search algorithms,   programmer algorithm,   approximate algorithms,   "algorithms",   genetic alg,   routing algorithm,   algorith,   algorithm design,   This book @Amazon  View Tools Google Search Web flazx.com

Description This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research Other books on Algorithms Network Models and Optimization: Multiobjective Genetic Algorithm Approach (Decision Engineering) Encyclopedia of Algorithms How to Think About Algorithms Algorithms for Fuzzy Clustering: Methods in c-Means Clustering with Applications (Studies in Fuzziness and Soft Computing) Parallel Iterative Algorithms: From Sequential to Grid Computing (Chapman & Hall/Crc Numerical Analy & Scient Comp. Series) Genome Sequencing Technology and Algorithms Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings (Lecture Notes in Computer Science) Visibility Algorithms in the Plane Algorithms on Strings Scheduling Algorithms Practical Optimization: Algorithms and Engineering Applications Quantum Monte Carlo: Origins, Development, Applications Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) A Programmer's Companion to Algorithm Analysis The Design and Analysis of Algorithms (Monographs in Computer Science)