The Design of Approximation Algorithms
by D. P. Williamson, D. B. Shmoys
Publisher: Cambridge University Press 2010
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:
by James Aspnes - 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.
by Steven M. LaValle - Cambridge University Press
Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.
by Jianer Chen
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
by John Morris
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.