589689.xyz

Coursera- Algorithm Design & Analysis 2

  • 收录时间:2018-04-24 04:24:20
  • 文件大小:2GB
  • 下载次数:123
  • 最近下载:2021-01-22 16:00:36
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 9 - 3 - A Greedy Algorithm (17 min).mp4 25MB
  2. 2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24MB
  3. 8 - 7 - The Ackermann Function [Advanced - Optional](17 min).mp4 23MB
  4. 20 - 1 - Stable Matching [Optional] (15 min).mp4 23MB
  5. 8 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).mp4 22MB
  6. 2 - 7 - Dijkstra_'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 22MB
  7. 19 - 7 - Analysis of Papadimitriou_'s Algorithm (15 min).mp4 22MB
  8. 8 - 4 - Path Compression [Advanced - Optional] (15).mp4 22MB
  9. 19 - 6 - Random Walks on a Line (16 min).mp4 21MB
  10. 17 - 4 - The Traveling Salesman Problem (15 min).mp4 21MB
  11. 20 - 2 - Matchings, Flows, and Braess_'s Paradox [Optional] (14 min).mp4 21MB
  12. 8 - 8 - Path Compression_ Tarjan_'s Analysis I [Advanced - Optional].mp4 21MB
  13. 16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4 20MB
  14. 2 - 2 - Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 20MB
  15. 16 - 2 - Reductions and Completeness (14 min).mp4 20MB
  16. 16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20MB
  17. 5 - 6 - Fast Implementation I (15 min).mp4 20MB
  18. 19 - 5 - The 2-SAT Problem (15 min).mp4 20MB
  19. 15 - 4 - A Reweighting Technique (14 min).mp4 20MB
  20. 12 - 1 - Optimal Substructure (14 min).mp4 20MB
  21. 2 - 9 - Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 19MB
  22. 8 - 9 - Path Compression_ Tarjan_'s Analysis II [Advanced - Optional].mp4 19MB
  23. 5 - 3 - Correctness Proof I (16 min).mp4 19MB
  24. 15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4 19MB
  25. 6 - 4 - Implementing Kruskal_'s Algorithm via Union-Find II (14 min).mp4 19MB
  26. 2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19MB
  27. 18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4 19MB
  28. 18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4 19MB
  29. 14 - 6 - A Space Optimization (12 min).mp4 18MB
  30. 2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4 18MB
  31. 8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4 18MB
  32. 3 - 1 - Introduction to Greedy Algorithms (13 min).mp4 18MB
  33. 17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4 17MB
  34. 13 - 1 - Problem Definition (12 min).mp4 17MB
  35. 8 - 6 - Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 17MB
  36. 4 - 2 - A Greedy Algorithm (13 min).mp4 17MB
  37. 15 - 6 - Johnson_'s Algorithm II (11 min).mp4 17MB
  38. 20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4 17MB
  39. 9 - 6 - Correctness Proof II (13 min).mp4 17MB
  40. 14 - 7 - Internet Routing I [Optional] (11 min).mp4 17MB
  41. 12 - 2 - A Dynamic Programming Algorithm (12 min).mp4 17MB
  42. 15 - 2 - Optimal Substructure (12 min).mp4 17MB
  43. 16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4 16MB
  44. 15 - 5 - Johnson_'s Algorithm I (11 min).mp4 15MB
  45. 18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15MB
  46. 9 - 2 - Problem Definition (10 min).mp4 15MB
  47. 14 - 2 - Optimal Substructure (11 min).mp4 15MB
  48. 8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4 15MB
  49. 14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4 15MB
  50. 7 - 1 - Application to Clustering (12 min).mp4 15MB
  51. 5 - 1 - MST Problem Definition (11 min).mp4 15MB
  52. 5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4 15MB
  53. 3 - 2 - Application_ Optimal Caching (11 min).mp4 15MB
  54. 10 - 3 - WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4 15MB
  55. 19 - 4 - Principles of Local Search II (10 min).mp4 14MB
  56. 2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4 14MB
  57. 16 - 5 - The P vs. NP Question (9 min).mp4 14MB
  58. 6 - 5 - MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14MB
  59. 17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4 14MB
  60. 11 - 1 - The Knapsack Problem (10 min).mp4 14MB
  61. 13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4 14MB
  62. 13 - 2 - Optimal Substructure (9 min).mp4 14MB
  63. 1 - 1 - Application_ Internet Routing (11 min).mp4 14MB
  64. 8 - 5 - Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4 14MB
  65. 11 - 2 - A Dynamic Programming Algorithm (10 min).mp4 14MB
  66. 14 - 4 - The Basic Algorithm II (11 min).mp4 14MB
  67. 10 - 2 - WIS in Path Graphs_ Optimal Substructure (9 min).mp4 14MB
  68. 9 - 5 - Correctness Proof I (10 min).mp4 13MB
  69. 18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4 13MB
  70. 5 - 7 - Fast Implementation II (10 min).mp4 13MB
  71. 6 - 3 - Implementing Kruskal_'s Algorithm via Union-Find I (9 min).mp4 13MB
  72. 19 - 2 - The Maximum Cut Problem II (9 min).mp4 13MB
  73. 14 - 5 - Detecting Negative Cycles (9 min).mp4 13MB
  74. 17 - 1 - The Vertex Cover Problem (9 min).mp4 13MB
  75. 19 - 1 - The Maximum Cut Problem I (9 min).mp4 12MB
  76. 18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12MB
  77. 6 - 2 - Correctness of Kruskal_'s Algorithm (9 min).mp4 12MB
  78. 10 - 5 - Principles of Dynamic Programming (8 min).mp4 12MB
  79. 19 - 3 - Principles of Local Search I (9 min).mp4 12MB
  80. 16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4 12MB
  81. 14 - 3 - The Basic Algorithm I (9 min).mp4 12MB
  82. 13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4 12MB
  83. 7 - 2 - Correctness of Clustering Algorithm (10 min).mp4 12MB
  84. 9 - 1 - Introduction and Motivation (9 min).mp4 12MB
  85. 10 - 1 - Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4 11MB
  86. 1 - 2 - Application_ Sequence Alignment (9 min).mp4 11MB
  87. 6 - 1 - Kruskal_'s MST Algorithm (8 min).mp4 11MB
  88. 14 - 8 - Internet Routing II [Optional] (7 min).mp4 11MB
  89. 17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4 10MB
  90. 5 - 4 - Correctness Proof II (8 min).mp4 10MB
  91. 5 - 2 - Prim_'s MST Algorithm (8 min).mp4 10MB
  92. 13 - 3 - Proof of Optimal Substructure (7 min).mp4 10MB
  93. 4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4 10MB
  94. 10 - 4 - WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4 10MB
  95. 15 - 1 - Problem Definition (7 min).mp4 9MB
  96. 4 - 3 - Correctness Proof - Part I (7 min).mp4 9MB
  97. 18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 9MB
  98. 4 - 1 - Problem Definition (6 min).mp4 8MB
  99. 4 - 4 - Correctness Proof - Part II (5 min).mp4 6MB
  100. algo2-np-wider123-annotated.pdf 5MB
  101. 2 - 8 - Data Structures_ Overview [Part I Review - Optional] (5).mp4 5MB
  102. 2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4MB
  103. algo2-greedy-huffman45-annotated.pdf 3MB
  104. algo2-greedy-union-find89-annotated.pdf 3MB
  105. algo2-greedy-kruskal34-annotated.pdf 3MB
  106. algo2-greedy-mst6-annotated.pdf 3MB
  107. algo2-dp-bst23-annotated.pdf 3MB
  108. algo2-np-local12-annotated.pdf 3MB
  109. algo2-dp-apsp56-annotated.pdf 3MB
  110. algo2-greedy-union-find56-annotated.pdf 3MB
  111. algo2-np-exact4-annotated.pdf 3MB
  112. algo2-dp-bst45-annotated.pdf 3MB
  113. algo2-np-approx23-annotated.pdf 3MB
  114. algo1-dijkstra-basics.pdf 3MB
  115. algo2-np-exact23-annotated.pdf 3MB
  116. algo2-greedy-huffman3-annotated.pdf 3MB
  117. algo2-np-local34-annotated.pdf 3MB
  118. algo2-greedy-union-find3-annotated.pdf 3MB
  119. algo2-np-local7-annotated.pdf 2MB
  120. algo2-greedy-union-find7-annotated.pdf 2MB
  121. algo2-greedy-mst3-annotated.pdf 2MB
  122. algo2-dp-apsp4-annotated.pdf 2MB
  123. algo2-dp-alignment1-annotated.pdf 2MB
  124. algo2-dp-bf34-annotated.pdf 2MB
  125. algo1-graphs-search.pdf 2MB
  126. algo2-np-local6-annotated.pdf 2MB
  127. algo2-dp-alignment2-annotated.pdf 2MB
  128. algo2-np-npc34-annotated.pdf 2MB
  129. algo2-dp-bf6-annotated.pdf 2MB
  130. algo2-greedy-mst5-annotated.pdf 2MB
  131. algo2-greedy-union-find2-annotated.pdf 2MB
  132. algo1-ds-heaps-basics.pdf 2MB
  133. algo2-intro-alignment-annotated.pdf 2MB
  134. algo2-np-exact5-annotated.pdf 2MB
  135. algo2-np-approx1-annotated.pdf 2MB
  136. algo2-np-approx6-annotated.pdf 2MB
  137. algo2-greedy-union-find4-annotated.pdf 2MB
  138. algo2-dp-bf2-annotated.pdf 2MB
  139. algo2-dp-bst1-annotated.pdf 2MB
  140. algo2-greedy-huffman2-annotated.pdf 2MB
  141. algo2-dp-apsp3-annotated.pdf 2MB
  142. algo2-dp-apsp2-annotated.pdf 2MB
  143. algo2-np-npc1-annotated.pdf 2MB
  144. algo2-dp-bf1-annotated.pdf 2MB
  145. algo1-representations.pdf 2MB
  146. algo2-greedy-clustering1-annotated.pdf 2MB
  147. 20 - 4 - Epilogue (1 min).mp4 2MB
  148. algo2-np-npc2-annotated.pdf 2MB
  149. algo2-greedy-intro-annotated.pdf 2MB
  150. algo2-np-local5-annotated.pdf 2MB
  151. algo2-dp-bf78-annotated.pdf 2MB
  152. algo2-dp-wis2-annotated.pdf 2MB
  153. algo2-np-approx4-annotated.pdf 2MB
  154. algo2-greedy-huffman1-annotated.pdf 2MB
  155. algo2-greedy-union-find1-annotated.pdf 2MB
  156. algo2-greedy-sched2-annotated.pdf 2MB
  157. algo2-greedy-clustering2-annotated.pdf 2MB
  158. algo2-greedy-mst1-annotated.pdf 2MB
  159. algo2-dp-wis3-annotated.pdf 2MB
  160. algo2-greedy-kruskal2-annotated.pdf 2MB
  161. algo2-dp-knapsack1-annotated.pdf 1MB
  162. algo2-np-approx5-annotated.pdf 1MB
  163. algo2-dp-knapsack2-annotated.pdf 1MB
  164. algo2-intro-routing-annotated.pdf 1MB
  165. algo1-guiding.pdf 1MB
  166. algo2-greedy-sched5-annotated.pdf 1MB
  167. algo2-greedy-sched3-annotated.pdf 1MB
  168. algo2-np-npc5-annotated.pdf 1MB
  169. algo1-intro.pdf 1MB
  170. algo2-greedy-kruskal5-annotated.pdf 1MB
  171. algo2-dp-bf5-annotated.pdf 1MB
  172. algo2-np-exact1-annotated.pdf 1MB
  173. algo2-dp-wis1-annotated.pdf 1MB
  174. algo2-dp-wis4-annotated.pdf 1MB
  175. algo2-greedy-fif-annotated.pdf 1MB
  176. algo2-greedy-mst2-annotated.pdf 1MB
  177. algo2-np-npc6-annotated.pdf 1MB
  178. algo2-greedy-mst4-annotated.pdf 1MB
  179. algo2-dp-apsp1-annotated.pdf 1MB
  180. algo2-greedy-sched4-annotated.pdf 950KB
  181. algo2-greedy-sched1-annotated.pdf 944KB
  182. algo2-dp-wis5-annotated.pdf 862KB
  183. algo1-ds-overview.pdf 844KB
  184. algo2-greedy-kruskal1-annotated.pdf 752KB
  185. algo1-asymptotic1.pdf 660KB
  186. algo1-about.pdf 209KB
  187. imgres.html 24KB