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

by K. Mehlhorn, P. Sanders

**Publisher**: Springer 2008**ISBN/ASIN**: 3642096824**ISBN-13**: 9783642096822**Number of pages**: 300

**Description**:

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, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**10246**views)

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

(

**7168**views)

**Design and Analysis of Computer Algorithms**

by

**David M. Mount**-

**University of Maryland**

The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.

(

**12399**views)

**Greedy Algorithms**

by

**Witold Bednorz**-

**InTech**

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.

(

**10009**views)