The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Contents ■ War Story: Mystery of the Pyramids ■ War Story: String 'em Up ■ Exercises ❍ Breaking Problems Down ■ Dynamic Programming ■ Fibonacci numbers ■ The Partition Problem ■ Approximate String Matching ■ Longest Increasing Sequence ■ Minimum Weight Triangulation ■ Limitations of Dynamic Programming ■ War Story: Evolution of the Lobster ■ War Story: What's Past is Prolog ■ War Story: Text Compression for Bar Codes ■ Divide and Conquer ■ Fast Exponentiation ■ Binary Search ■ Square and Other Roots ■ Exercises ❍ Graph Algorithms ■ The Friendship Graph ■ Data Structures for Graphs ■ War Story: Getting the Graph ■ Traversing a Graph ■ Breadth-First Search ■ Depth-First Search ■ Applications of Graph Traversal ■ Connected Components ■ Tree and Cycle Detection ■ Two-Coloring Graphs ■ Topological Sorting ■ Articulation Vertices ■ Modeling Graph Problems ■ Minimum Spanning Trees ■ Prim's Algorithm ■ Kruskal's Algorithm ■ Shortest Paths ■ Dijkstra's Algorithm file:///E|/BOOK/BOOK/NODE4.HTM (2 of 7) [19/1/2003 1:27:35]
Contents ■ All-Pairs Shortest Path ■ War Story: Nothing but Nets ■ War Story: Dialing for Documents ■ Exercises ❍ Combinatorial Search and Heuristic Methods ■ Backtracking ■ Constructing All Subsets ■ Constructing All Permutations ■ Constructing All Paths in a Graph ■ Search Pruning ■ Bandwidth Minimization ■ War Story: Covering Chessboards ■ Heuristic Methods ■ Simulated Annealing ■ Traveling Salesman Problem ■ Maximum Cut ■ Independent Set ■ Circuit Board Placement ■ Neural Networks ■ Genetic Algorithms ■ War Story: Annealing Arrays ■ Parallel Algorithms ■ War Story: Going Nowhere Fast ■ Exercises ❍ Intractable Problems and Approximations ■ Problems and Reductions ■ Simple Reductions ■ Hamiltonian Cycles ■ Independent Set and Vertex Cover ■ Clique and Independent Set ■ Satisfiability ■ The Theory of NP-Completeness ■ 3-Satisfiability ■ Difficult Reductions ■ Integer Programming ■ Vertex Cover ■ Other NP-Complete Problems ■ The Art of Proving Hardness file:///E|/BOOK/BOOK/NODE4.HTM (3 of 7) [19/1/2003 1:27:35]
- Page 1 and 2: The Algorithm Design Manual Next: P
- Page 3 and 4: Preface Next: Acknowledgments Up: T
- Page 5 and 6: Preface one stressing design over a
- Page 7 and 8: Acknowledgments Mon Jun 2 23:33:50
- Page 9: Contents Next: Techniques Up: The A
- Page 13 and 14: Contents ■ Graph Problems: Polyno
- Page 15 and 16: Contents ● About this document ..
- Page 17 and 18: The Algorithm Design Manual The Alg
- Page 19 and 20: Lecture Notes -- Analysis of Algori
- Page 21 and 22: Lecture Notes -- Analysis of Algori
- Page 23 and 24: The Stony Brook Algorithm Repositor
- Page 25 and 26: Techniques Next: Introduction to Al
- Page 27 and 28: Techniques Algorithms Mon Jun 2 23:
- Page 29 and 30: Introduction to Algorithms ● Reas
- Page 31 and 32: Data Structures and Sorting divide-
- Page 33 and 34: Breaking Problems Down ● Dynamic
- Page 35 and 36: Graph Algorithms The take-home less
- Page 37 and 38: Combinatorial Search and Heuristic
- Page 39 and 40: Intractable Problems and Approximat
- Page 41 and 42: How to Design Algorithms Next: Reso
- Page 43 and 44: How to Design Algorithms with a cou
- Page 45 and 46: How to Design Algorithms Next: Reso
- Page 47 and 48: A Catalog of Algorithmic Problems N
- Page 49 and 50: A Catalog of Algorithmic Problems
- Page 51 and 52: Algorithmic Resources Next: Softwar
- Page 53 and 54: References L. Adleman. Algorithmic
- Page 55 and 56: References AS89 Ata83 Ata84 problem
- Page 57 and 58: References BJL 91 A. Blum, T. Jiang
- Page 59 and 60: References BS81 BS86 BS93 BS96 BS97
Contents<br />
■ War Story: Mystery of the Pyramids<br />
■ War Story: String 'em Up<br />
■ Exercises<br />
❍ Breaking Problems Down<br />
■ Dynamic Programming<br />
■ Fibonacci numbers<br />
■ <strong>The</strong> Partition Problem<br />
■ Approximate String Matching<br />
■ Longest Increasing Sequence<br />
■ Minimum Weight Triangulation<br />
■ Limitations of Dynamic Programming<br />
■ War Story: Evolution of the Lobster<br />
■ War Story: What's Past is Prolog<br />
■ War Story: Text Compression for Bar Codes<br />
■ Divide and Conquer<br />
■ Fast Exponentiation<br />
■ Binary Search<br />
■ Square and Other Roots<br />
■ Exercises<br />
❍ Graph <strong>Algorithm</strong>s<br />
■ <strong>The</strong> Friendship Graph<br />
■ Data Structures for Graphs<br />
■ War Story: Getting the Graph<br />
■ Traversing a Graph<br />
■ Breadth-First Search<br />
■ Depth-First Search<br />
■ Applications of Graph Traversal<br />
■ Connected Components<br />
■ Tree and Cycle Detection<br />
■ Two-Coloring Graphs<br />
■ Topological Sorting<br />
■ Articulation Vertices<br />
■ Modeling Graph Problems<br />
■ Minimum Spanning Trees<br />
■ Prim's <strong>Algorithm</strong><br />
■ Kruskal's <strong>Algorithm</strong><br />
■ Shortest Paths<br />
■ Dijkstra's <strong>Algorithm</strong><br />
file:///E|/BOOK/BOOK/NODE4.HTM (2 of 7) [19/1/2003 1:27:35]
Change language