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: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(9786 views)
Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
(21381 views)
Book cover: Notes on Data Structures and Programming TechniquesNotes on Data Structures and Programming Techniques
by - Yale University
Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.
(4458 views)
Book cover: Modern Computer ArithmeticModern Computer Arithmetic
by - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(11327 views)