This expanded and updated second edition of a classic bestseller continues totake the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website. INDICE: Part I: Practical Algorithm Design. Introduction to Algorithms. Algorithm Analysis. Data Structures. Sorting and Searching. Graph Traversal. Weighted Graph Algoyithms.fCombinatorial Search and Heuristhc Methots. Dynamic Programming. Intractable Problems and Approximations. How to Design Algorithms.-Part II: The Hitchhiker's Guide to Algorithms. A Catalog of Algorithmic Problems. Data Structures. Numerical Problems. Combinatorical Problems. Graph Problems: Polynomial-Time. Graph Problems: Hard Problems. Computational Geometry. Set and String Problems. Algorithmic Resources.- Bibliography.- Index.
- ISBN: 978-1-84800-069-8
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 730
- Fecha Publicación: 01/08/2008
- Nº Volúmenes: 1
- Idioma: Inglés