**Greedy Algorithms**

by Witold Bednorz

**Publisher**: InTech 2008**ISBN-13**: 9789537619275**Number of pages**: 586

**Description**:

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 author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.

Download or read it online for free here:

**Download link**

(47MB, PDF)

## Similar books

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**10055**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**14528**views)

**Data Structures and Algorithm Analysis in C++**

by

**Clifford A. Shaffer**-

**Dover Publications**

A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.

(

**9870**views)

**Algorithms: Fundamental Techniques**

by

**Macneil Shonle, Matthew Wilson, Martin Krischik**-

**Wikibooks**

An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.

(

**11097**views)