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
Problems on Algorithms, 2nd editionby Ian Parberry, William Gasarch - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(17322 views)
Algorithmsby Jeff Erickson - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
(16175 views)
The Design of Approximation Algorithmsby 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.
(14485 views)
Algorithmsby Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(14181 views)