Logo

The Design of Approximation Algorithms

Large book cover: The Design of Approximation Algorithms

The Design of Approximation Algorithms
by

Publisher: Cambridge University Press
ISBN/ASIN: 0521195276
ISBN-13: 9780521195270
Number of pages: 496

Description:
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

Home page url

Download or read it online for free here:
Download link
(2.3MB, PDF)

Similar books

Book cover: Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
by - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(12233 views)
Book cover: Algorithms for Clustering DataAlgorithms for Clustering Data
by - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(12999 views)
Book cover: Purely Functional Data StructuresPurely Functional Data Structures
by - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
(3548 views)
Book cover: Efficient Algorithms for Sorting and SynchronizationEfficient Algorithms for Sorting and Synchronization
by - samba.org
This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
(8721 views)