Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.
ISBN 3540653678 / 9783540653677 / 3-540-65367-8
› Find signed collectible books: 'Approximation Algorithms.'
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 BerkeleyFollowing 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.Lszl Lovsz, Senior Researcher, Microsoft Research TOCIntroduction.- I. Combinatorial Algorithms Set cover. Steiner tree and TSP. Multiway cuts and k-cuts. k-center. Feedback vertex set. Shortest superstring. Knapsack. Bin packing. Minimum makespan scheduling. Euclidean TSP.- II. LP-Based Algorithms Introduction to LP-duality. Rounding applied to set cover. LP-duality based analysis for set cover. The primal-dual schema. Maximum satisfiability. Scheduling on unrelated parall ... [via]