Mardigian Library
Ask a QuestionMy Library Account
Search Library Catalog - Books, DVDs & More
Limit to available
More Searches
Limit results to available items
Find more results:
Search MelCat
More Information
Skiena, Steven S
The algorithm design manual / Steven S. Skiena
2nd ed
London : Springer, 2012, c2008
book jacket
Location Call Number Status
 4th Floor  QA76.9.A43 S55 2012    DUE 09-04-14 OFF CAMPUS
Subject(s) Computer algorithms
Physical Description xvi, 730 p. : ill. ; 25 cm
Note "Corrected printing, 2012"--t.p. verso
Previous ed.: 1997
Includes bibliographical references (p. [665]-707) and index
Contents Practical algorithm design: Introduction to algorithms ; Algorithm analysis ; Data structures ; Sorting and searching ; Graph traversal ; Weighted graph algorithms ; Combinatorial search and heuristic methods ; Dynamic programming ; Intractable problems and approximations ; 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
Summary This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficacy 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
NOTE 507508

Mardigian Library, 4901 Evergreen Rd.
Dearborn, MI 48128-1491 313-593-5400 fax 313-593-5561
The Regents of the University of Michigan | Non-Discrimination Policy
Copyright © The University of Michigan - Dearborn • 4901 Evergreen Road • Dearborn, Michigan 48128 • 313-593-5000
The University of Michigan - Ann Arbor | The University of Michigan - Flint | SITEMAP | DIRECTORY | CONTACT