The Algorithm Design Manual: TextSpringer Science & Business Media, 1998 - 486 էջ 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. |
Բովանդակություն
Introduction to Algorithms | 3 |
1 | 15 |
1 | 22 |
9 | 43 |
9 | 47 |
15 | 52 |
Breaking Problems Down | 53 |
36 | 69 |
Intractable Problems and Approximations | 139 |
How to Design Algorithms | 163 |
A Catalog of Algorithmic Problems | 171 |
21 | 207 |
25 | 244 |
30 | 250 |
Algorithmic Resources | 427 |
Bibliography | 439 |
Graph Algorithms | 75 |
18 | 111 |
Combinatorial Search and Heuristic Methods | 115 |
20 | 121 |
447 | |
463 | |
Այլ խմբագրություններ - View all
Common terms and phrases
applications array backtracking binary search characters clause clique coloring combinatorial connected components constraints construct contains convex hull cost data structures defined delete depth-first search dictionary discussed in Section dynamic programming edge efficient algorithm elements example expositions faster Fortran function geometric given graph algorithms graph G Hamiltonian cycle hard heuristic implementations independent set Input description insertion integer integer partitions intersection isomorphism kd-trees linear programming linear-time longest matrix maximum minimize minimum spanning tree Netlib network flow node NP-complete O(n lg O(n² O(n³ optimal OUTPUT pair partition performance permutations pixels planar graph polygon possible priority queue Problem description provides query random number reduction Related Problems search trees sequence set cover shortest path simulated annealing smallest solution solve subgraph subsets substring suffix tree topological sort tour traveling salesman triangle undirected graph variables vertex cover vertices Voronoi diagrams weight