The Design of Approximation Algorithms

Large book cover: The Design of Approximation Algorithms

The Design of Approximation Algorithms

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

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: Essentials of MetaheuristicsEssentials of Metaheuristics
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.
Book cover: Data Structures and AlgorithmsData Structures and Algorithms
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
Book cover: Combinatorial AlgorithmsCombinatorial Algorithms
by - Academic Press Inc
This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.
Book cover: Data Structures and AlgorithmsData Structures and Algorithms
by - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.