**Design and Analysis of Algorithms**

by Herbert Edelsbrunner

**Publisher**: Duke University 2008**Number of pages**: 95

**Description**:

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.

Download or read it online for free here:

**Download link**

(1MB, PDF)

## Similar books

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**12045**views)

**Knapsack Problems: Algorithms and Computer Implementations**

by

**Silvano Martello, Paolo Toth**-

**John Wiley & Sons**

The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.

(

**18267**views)

**Planning Algorithms**

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.

(

**20937**views)

**Algorithms and Data Structures: The Basic Toolbox**

by

**K. Mehlhorn, P. Sanders**-

**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.

(

**15040**views)