The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Contents ■ War Story: Hard Against the Clock ■ Approximation Algorithms ■ Approximating Vertex Cover ■ The Euclidean Traveling Salesman ■ Exercises ❍ How to Design Algorithms ● Resources ❍ A Catalog of Algorithmic Problems ■ Data Structures ■ Dictionaries ■ Priority Queues ■ Suffix Trees and Arrays ■ Graph Data Structures ■ Set Data Structures ■ Kd-Trees ■ Numerical Problems ■ Solving Linear Equations ■ Bandwidth Reduction ■ Matrix Multiplication ■ Determinants and Permanents ■ Constrained and Unconstrained Optimization ■ Linear Programming ■ Random Number Generation ■ Factoring and Primality Testing ■ Arbitrary-Precision Arithmetic ■ Knapsack Problem ■ Discrete Fourier Transform ■ Combinatorial Problems ■ Sorting ■ Searching ■ Median and Selection ■ Generating Permutations ■ Generating Subsets ■ Generating Partitions ■ Generating Graphs ■ Calendrical Calculations ■ Job Scheduling ■ Satisfiability file:///E|/BOOK/BOOK/NODE4.HTM (4 of 7) [19/1/2003 1:27:35]
Contents ■ Graph Problems: Polynomial-Time ■ Connected Components ■ Topological Sorting ■ Minimum Spanning Tree ■ Shortest Path ■ Transitive Closure and Reduction ■ Matching ■ Eulerian Cycle / Chinese Postman ■ Edge and Vertex Connectivity ■ Network Flow ■ Drawing Graphs Nicely ■ Drawing Trees ■ Planarity Detection and Embedding ■ Graph Problems: Hard Problems ■ Clique ■ Independent Set ■ Vertex Cover ■ Traveling Salesman Problem ■ Hamiltonian Cycle ■ Graph Partition ■ Vertex Coloring ■ Edge Coloring ■ Graph Isomorphism ■ Steiner Tree ■ Feedback Edge/Vertex Set ■ Computational Geometry ■ Robust Geometric Primitives ■ Convex Hull ■ Triangulation ■ Voronoi Diagrams ■ Nearest Neighbor Search ■ Range Search ■ Point Location ■ Intersection Detection ■ Bin Packing ■ Medial-Axis Transformation ■ Polygon Partitioning ■ Simplifying Polygons file:///E|/BOOK/BOOK/NODE4.HTM (5 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 and 10: Contents Next: Techniques Up: The A
- Page 11: Contents ■ All-Pairs Shortest Pat
- 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
- Page 61 and 62: References J. M. Chambers. Partial
Contents<br />
■ Graph Problems: Polynomial-Time<br />
■ Connected Components<br />
■ Topological Sorting<br />
■ Minimum Spanning Tree<br />
■ Shortest Path<br />
■ Transitive Closure and Reduction<br />
■ Matching<br />
■ Eulerian Cycle / Chinese Postman<br />
■ Edge and Vertex Connectivity<br />
■ Network Flow<br />
■ Drawing Graphs Nicely<br />
■ Drawing Trees<br />
■ Planarity Detection and Embedding<br />
■ Graph Problems: Hard Problems<br />
■ Clique<br />
■ Independent Set<br />
■ Vertex Cover<br />
■ Traveling Salesman Problem<br />
■ Hamiltonian Cycle<br />
■ Graph Partition<br />
■ Vertex Coloring<br />
■ Edge Coloring<br />
■ Graph Isomorphism<br />
■ Steiner Tree<br />
■ Feedback Edge/Vertex Set<br />
■ Computational Geometry<br />
■ Robust Geometric Primitives<br />
■ Convex Hull<br />
■ Triangulation<br />
■ Voronoi Diagrams<br />
■ Nearest Neighbor Search<br />
■ Range Search<br />
■ Point Location<br />
■ Intersection Detection<br />
■ Bin Packing<br />
■ Medial-Axis Transformation<br />
■ Polygon Partitioning<br />
■ Simplifying Polygons<br />
file:///E|/BOOK/BOOK/NODE4.HTM (5 of 7) [19/1/2003 1:27:35]
Change language