//
you're reading...
00 - Chủ đề chung, Hỗ trợ, Đồ án - nghiên cứu

Zoom – Tổng hợp các vấn đề nghiên cứu

[Sắp xếp theo The Algorithm Design Manual 2ed by Steven S. Skiena]


0 Contents Diễn giải
1 Practical Algorithm Design
2 Introduction to Algorithm Design
3 Robot Tour Optimization
4 Selecting the Right Jobs
5 Reasoning about Correctness
6 Modeling the Problem
7 About the War Stories
8 War Story: Psychic Modeling
9 Exercises
10 Algorithm Analysis
11 The RAM Model of Computation
12 The Big Oh Notation
13 Growth Rates and Dominance Relations
14 Working with the Big Oh
15 Reasoning About Efficiency
16 Logarithms and Their Applications
17 Properties of Logarithms
18 War Story: Mystery of the Pyramids
19 Advanced Analysis (*)
20 Exercises
21 Data Structures
22 Contiguous vs Linked Data Structures
23 Stacks and Queues
24 Dictionaries
25 Binary Search Trees
26 Priority Queues
27 War Story: Stripping Triangulations
28 Hashing and Strings
29 Specialized Data Structures
30 War Story: String ’em Up
31 Exercises
32 Sorting and Searching
33 Applications of Sorting
34 Pragmatics of Sorting
35 Heapsort: Fast Sorting via Data Structures
36 War Story: Give me a Ticket on an Airplane
37 Mergesort: Sorting by Divide-and-Conquer
38 Quicksort: Sorting by Randomization
39 Distribution Sort: Sorting via Bucketing
40 War Story: Skiena for the Defense
41 Binary Search and Related Algorithms
42 Divide-and-Conquer
43 Exercises
44 Graph Traversal
45 Flavors of Graphs
46 Data Structures for Graphs
47 War Story: I was a Victim of Moore’s Law
48 War Story: Getting the Graph
49 Traversing a Graph
50 Breadth-First Search
51 Applications of Breadth-First Search
52 Depth-First Search
53 Applications of Depth-First Search
54 Depth-First Search on Directed Graphs
55 Exercises
56 Weighted Graph Algorithms
57 Minimum Spanning Trees
58 War Story: Nothing but Nets
59 Shortest Paths
60 War Story: Dialing for Documents
61 Network Flows and Bipartite Matching
62 Design Graphs, Not Algorithms
63 Exercises
64 Combinatorial Search and Heuristic Methods
65 Backtracking
66 Search Pruning
67 Sudoku
68 War Story: Covering Chessboards
69 Heuristic Search Methods
70 War Story: Only it is Not a Radio
71 War Story: Annealing Arrays
72 Other Heuristic Search Methods
73 Parallel Algorithms
74 War Story: Going Nowhere Fast
75 Exercises
76 Dynamic Programming
77 Caching vs Computation
78 Approximate String Matching
79 Longest Increasing Sequence
80 War Story: Evolution of the Lobster
81 The Partition Problem
82 Parsing Context-Free Grammars
83 Limitations of Dynamic Programming: TSP
84 War Story: What’s Past is Prolog
85 War Story: Text Compression for Bar Codes
86 Exercises
87 Intractable Problems and Approximation Algorithms
88 Problems and Reductions
89 Reductions for Algorithms
90 Elementary Hardness Reductions
91 Satisfiability
92 Creative Reductions
93 The Art of Proving Hardness
94 War Story: Hard Against the Clock
95 War Story: And Then I Failed
96 Dealing with NP-complete Problems
97 Exercises
98 How to Design Algorithms
99 The Hitchhiker’s Guide to Algorithms
100  A Catalog of Algorithmic Problems
101 Data Structures
102 Dictionaries
103 Priority Queues
104 Suffix Trees and Arrays
105 Graph Data Structures
106 Set Data Structures
107 Kd-Trees
108 Numerical Problems
109 Solving Linear Equations
110 Bandwidth Reduction
111 Matrix Multiplication
112 Determinants and Permanents
113 Constrained and Unconstrained Optimization
114 Linear Programming
115 Random Number Generation
116 Factoring and Primality Testing
117 Arbitrary-Precision Arithmetic
118 Knapsack Problem
119 Discrete Fourier Transform
120 Combinatorial Problems
121 Sorting
122 Searching
123 Median and Selection
124 Generating Permutations
125 Generating Subsets
126 Generating Partitions
127 Generating Graphs
128 Calendrical Calculations
129 Job Scheduling
130 Satisfiability
131 Graph Problems: Polynomial-Time
132 Connected Components
133 Topological Sorting
134 Minimum Spanning Tree
135 Shortest Path
136 Transitive Closure and Reduction
137 Matching
138 Eulerian Cycle/Chinese Postman
139 Edge and Vertex Connectivity
140 Network Flow
141 Drawing Graphs Nicely
142 Drawing Trees
143 Planarity Detection and Embedding
144 Graph Problems: Hard Problems
145 Clique
146 Independent Set
147 Vertex Cover
148 Traveling Salesman Problem
149 Hamiltonian Cycle
150 Graph Partition
151 Vertex Coloring
152 Edge Coloring
153 Graph Isomorphism
154 Steiner Tree
155 Feedback Edge/Vertex Set
156 Computational Geometry
157 Robust Geometric Primitives
158 Convex Hull
159 Triangulation
160 Voronoi Diagrams
161 Nearest Neighbor Search
162 Range Search
163 Point Location
164 Intersection Detection
165 Bin Packing
166 Medial-Axis Transform
167 Polygon Partitioning
168 Simplifying Polygons
169 Shape Similarity
170 Motion Planning
171 Maintaining Line Arrangements
172 Minkowski Sum
173 Set and String Problems
174 Set Cover
175 Set Packing
176 String Matching
177 Approximate String Matching
178 Text Compression
179 Cryptography
180 Finite State Machine Minimization
181 Longest Common Substring/Subsequence
182 Shortest Common Superstring
183 Algorithmic Resources
184 Software Systems
185 Data Sources
186 Online Bibliographic Resources
187 Professional Consulting Services
188 Bibliography
189 Index

About pascalteacher

Trang thông tin Toán học và Tin học

Thảo luận

Chưa có phản hồi.

Gửi phản hồi

Mời bạn điền thông tin vào ô dưới đây hoặc kích vào một biểu tượng để đăng nhập:

WordPress.com Logo

Bạn đang bình luận bằng tài khoản WordPress.com Log Out / Thay đổi )

Twitter picture

Bạn đang bình luận bằng tài khoản Twitter Log Out / Thay đổi )

Facebook photo

Bạn đang bình luận bằng tài khoản Facebook Log Out / Thay đổi )

Google+ photo

Bạn đang bình luận bằng tài khoản Google+ Log Out / Thay đổi )

Connecting to %s

Các tác giả

Tháng Mười Một 2016
M T W T F S S
« Oct   Dec »
 123456
78910111213
14151617181920
21222324252627
282930  

NCT Computer

Flickr Photos

A bellezza di a natura (C☺rsica)

Southern White-faced Owl D75_5752.jpg

2016 Lake Yamanaka winter Fuji

More Photos

Thống kê

  • 78,768 lượt xem

%d bloggers like this: