tailieunhanh - skiena the algorithm design manual springer verlag

Tham khảo sách 'skiena the algorithm design manual springer verlag', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | The Algorithm Design Manual Next 1 Up Previous Contents 1 Index CD Home 1 Lecture Notes 1 Algorithms Repository Next Preface Up Main Page The Algorithm Design Manual Steven S. Skiena Department of Computer Science State University of New York Stony Brook Ny 11794-4400 algorith@ Copyright 1997 by Springer-Verlag New York Contents Techniques o Introduction to Algorithms o Data Structures and Sorting o Breaking Problems Down o Graph Algorithms o Combinatorial Search and Heuristic Methods o Intractable Problems and Approximations o How to Design Algorithms Resources o A Catalog of Algorithmic Problems o Algorithmic Resources References Index About this document . file E BOOK BOOK 1 of 2 19 1 2003 1 27 29 The Algorithm Design Manual Algorithms Mon Jun 2 23 33 50 EDT1997 file E BOOK BOOK 2 of 2 19 1 2003 1 27 30 Preface Previous Contents Index 1 CD Home 1 Lecture Notes Next Acknowledgments Up The Algorithm Design Manual Previous The Algorithm Design Manual Preface Most of the 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 is a tricky business because the successful algorithm designer needs 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 know how to find out what is known about a .