Expanding on the highly successful formula of the first edition, this 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.

Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been fully updated, and enhanced with new and expanded material on hashing and randomized algorithms, divide and conquer algorithms, and dealing with hard problems (including quantum algorithms) 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

Autorentext

Dr. Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University, with research interests in data science, natural language processing, and algorithms. He was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award "for outstanding contributions to undergraduate education ...and for influential textbooks and software."

Klappentext

Inhalt

TO UPDATE Practical Algorithm Design.- to Algorithm Design.- Algorithm Analysis.- Data Structures.- Sorting and Searching.- Graph Traversal.- Weighted Graph Algorithms.- Combinatorial Search and Heuristic Methods.- Dynamic Programming.- Intractable Problems and Approximation Algorithms.- How to Design Algorithms.- The Hitchhiker's Guide to Algorithms.- A Catalog of Algorithmic Problems.- Data Structures.- Numerical Problems.- Combinatorial Problems.- Graph Problems: Polynomial-Time.- Graph Problems: Hard Problems.- Computational Geometry.- Set and String Problems.- Algorithmic Resources.