The Algorithm Design ManualPaperback
List price $84.20
You save $6.79 (8%)
Free delivery worldwide
Dispatched in 3 business days
When will my order arrive?
- Publisher: Springer London Ltd
- Format: Paperback | 730 pages
- Dimensions: 178mm x 236mm x 41mm | 1,270g
- Publication date: 31 October 2010
- Publication City/Country: England
- ISBN 10: 1849967202
- ISBN 13: 9781849967204
- Edition: 2, Revised
- Edition statement: 2nd ed. 2008
- Illustrations note: 115 black & white illustrations, 2 black & white tables, biography
- Sales rank: 204,441
Most professional programmers that I've encountered are not well prepared to tackle algorithm design problems. This is a pity, because the techniques of algorithm design form one of the core practical technologies of computer science. Designing correct, efficient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: * Techniques - Good algorithm designers understand several fundamental algorithm design techniques, including data structures, dynamic programming, depth first search, backtracking, and heuristics. Perhaps the single most important design technique is modeling, the art of abstracting a messy real-world application into a clean problem suitable for algorithmic attack. * Resources - Good algorithm designers stand on the shoulders of giants. Rather than laboring from scratch to produce a new algorithm for every task, they can figure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing implementations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide sufficient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals.
Add item to wishlist
Other books in this category
USD$71.94 - Save $26.29 26% off - RRP $98.23
USD$77.59 - Save $8.29 (9%) - RRP $85.88
USD$64.38 - Save $55.69 46% off - RRP $120.07
USD$26.68 - Save $14.65 35% off - RRP $41.33
USD$88.08 - Save $5.47 (5%) - RRP $93.55
USD$16.34 - Save $0.02 - RRP $16.36
Steven Skiena is Professor of Computer Science at Stony Brook University. His research interests include the design of graph, string, and geometric algorithms, and their applications (particularly to biology). He is the author of four books, including "The Algorithm Design Manual" and "Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win". He is recipient of the ONR Young Investigator Award and the IEEE Computer Science and Engineering Undergraduate Teaching Award.
From the reviews of the second edition: "This is detailed and timeless book that I keep reaching for. A useful book that I can not keep access to long enough. It is a important book to have in your library. Unlike other algorithm books that I have the algorithms are written independent of any programming language." (Mary Anne, Cats and Dogs with Data, maryannedata.com, April, 2014) "The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. ... It is written in an informal style that I found pleasant and engaging. ... The book's unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress ... . the book succeeds admirably. ... would be helpful to the student who has never seen this material before. ... Overall, I recommend this book warmly." (Neelakantan Kartha, The Book Review Column, 2011) "Algorithms are the very heart of computing ... . This book is about right for most people. ... Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - 'war stories' in implementing algorithms. ... If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended." (Mike James, I Programmer, September, 2009) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. ... this work fills an important gap in the knowledge of CS practitioners and students. ... this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. ... This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) "For a decade, Steven Skiena's Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. ... Every programmer should read this book, and anyone working in the field should keep it close to hand. ... Would I recommend it? Absolutely. This is the best investment ... a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace ... graph problems are -- they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. ... every 1 - pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge's Blog, March, 2008) "...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography ... make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews)
Back cover copy
....The most comprehensive guide to designing practical and efficient algorithms!....The Algorithm Design Manual, Second Edition..".the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews"It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources."-- P. Takis Metaxas, Wellesley College"This is the most approachable book on algorithms I have." -- Megan Squire, Elon University, USA This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding onthe first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.The reader-friendly "Algorithm Design Manual" provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, "Techniques," provides accessible instructionon methods for designing and analyzing computer algorithms. The second part, "Resources," is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: Doubles the tutorial material and exercises over the first edition Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them Includes several NEW "war stories" relating experiences from real-world applications Provides up-to-date links leading to the very best algorithm "implementations" available in C, C++, and JavaADDITIONAL Learning Tools: Exercises include "job interview problems" from major software companies Highlighted take-home lesson boxes emphasize essential concepts Provides comprehensive references to both survey articles and the primary literature Exercises point to relevant programming contest challenge problems Many algorithms presented with actual code (written in C) as well as pseudo-code A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of "The Algorithm Design Manual" is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, "Programming Challenges: The Programming Contest Training Manual.""
Table of contents
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.