The Algorithm Design Manual: Text

Front Cover
Springer Science & Business Media, 1998 - Computers - 486 pages
19 Reviews
This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide.THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains:* a complete hypertext version of the full printed book.* the source code and URLs for all cited implementations.* over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.
 

What people are saying - Write a review

User ratings

5 stars
11
4 stars
4
3 stars
3
2 stars
0
1 star
1

Excellent book for studying algorithms

User Review  - asfhuvx - Overstock.com

Excellent book if youre looking to keep in touch with what you studied in college. Not as big and bulky as the CLR but it still contains most of the important algorithms and design techniques. Good reference book to carry around. Read full review

Good material Index sucks

User Review  - buynewtextbookcom - Overstock.com

I recently bought the second edition in order to do some personal research and as such did not plan on reading the book from covertocover. I intend to use the book as a reference and therefore utilize ... Read full review

Contents

Introduction to Algorithms
3
Data Structures and Sorting
27
Breaking Problems Down
53
Graph Algorithms
81
Combinatorial Search and Heuristic Methods
115
Intractable Problems and Approximations
139
How to Design Algorithms
163
A Catalog of Algorithmic Problems
171
Algorithmic Resources
427
Bibliography
439
Index
463
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1998)

Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University. He is the author of four well-regarded books: The Algorithm Design Manual (2008), Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win (2001), Programming Challenges (with Miguel Revilla, 2003) and Computational Discrete Mathematics (with Sriram Pemmaraju, 2003). Skiena heads the Lydia news/blog analysis project at Stony Brook, using large-scale text analysis to chart the frequency, sentiment and relationships among millions of people, places, and things. This technology forms the foundation of General Sentiment (http: //www.generalsentiment.com), where he serves as co-founder and Chief Scientist. Lydia news analysis has been applied to several social science research projects, including financial forecasting and presidential election analysis. The rankings underlying Who's Bigger? derive from this analysis.

Bibliographic information