Logo

Greedy Algorithms by Witold Bednorz

Small book cover: Greedy Algorithms

Greedy Algorithms
by

Publisher: InTech
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.

Home page url

Download or read it online for free here:
Download link
(47MB, PDF)

Similar books

Book cover: Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
by - Duke University
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.
(19802 views)
Book cover: Modern Computer ArithmeticModern Computer Arithmetic
by - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(15410 views)
Book cover: Essentials of MetaheuristicsEssentials of Metaheuristics
by
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.
(11529 views)
Book cover: Design and Analysis of Computer AlgorithmsDesign and Analysis of Computer Algorithms
by - 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.
(18474 views)