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
Problem Solving with Algorithms and Data Structures Using Pythonby Brad Miller, David Ranum - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(19735 views)
Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Designby Solomon I. Khmelnik - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
(11214 views)
Algorithms and Data Structures for External Memoryby 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.
(12511 views)
Purely Functional Data Structuresby Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
(10413 views)