589689.xyz

algo2-004

  • 收录时间:2018-06-21 01:25:17
  • 文件大小:2GB
  • 下载次数:266
  • 最近下载:2021-01-02 00:50:10
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.mp4 25MB
  2. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4 24MB
  3. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.mp4 24MB
  4. 08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4 23MB
  5. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.mp4 23MB
  6. 08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4 22MB
  7. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4 22MB
  8. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4 22MB
  9. 08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.mp4 22MB
  10. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.mp4 21MB
  11. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.mp4 21MB
  12. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4 21MB
  13. 08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4 21MB
  14. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.mp4 20MB
  15. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4 20MB
  16. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.mp4 20MB
  17. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4 20MB
  18. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.mp4 20MB
  19. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.mp4 20MB
  20. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.mp4 20MB
  21. 12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.mp4 20MB
  22. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4 19MB
  23. 08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4 19MB
  24. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.mp4 19MB
  25. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.mp4 19MB
  26. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4 19MB
  27. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.mp4 19MB
  28. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.mp4 19MB
  29. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4 19MB
  30. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.mp4 18MB
  31. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4 18MB
  32. 08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.mp4 18MB
  33. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.mp4 18MB
  34. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4 17MB
  35. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.mp4 17MB
  36. 08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.mp4 17MB
  37. 04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.mp4 17MB
  38. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.mp4 17MB
  39. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.mp4 17MB
  40. 09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.mp4 17MB
  41. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.mp4 17MB
  42. 12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.mp4 17MB
  43. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.mp4 17MB
  44. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4 16MB
  45. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.mp4 15MB
  46. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4 15MB
  47. 09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.mp4 15MB
  48. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.mp4 15MB
  49. 08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.mp4 15MB
  50. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.mp4 15MB
  51. 07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.mp4 15MB
  52. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.mp4 15MB
  53. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4 15MB
  54. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.mp4 15MB
  55. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4 15MB
  56. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.mp4 14MB
  57. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4 14MB
  58. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.mp4 14MB
  59. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4 14MB
  60. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4 14MB
  61. Assignments/11_Programming_Assignment_6/2sat6.txt 14MB
  62. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.mp4 14MB
  63. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.mp4 14MB
  64. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.mp4 14MB
  65. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.mp4 14MB
  66. 08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.mp4 14MB
  67. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.mp4 14MB
  68. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.mp4 14MB
  69. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4 14MB
  70. 09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.mp4 13MB
  71. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4 13MB
  72. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.mp4 13MB
  73. Assignments/7_Programming_Assignment_4/large.txt 13MB
  74. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4 13MB
  75. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.mp4 13MB
  76. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.mp4 13MB
  77. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.mp4 13MB
  78. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.mp4 12MB
  79. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4 12MB
  80. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.mp4 12MB
  81. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.mp4 12MB
  82. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.mp4 12MB
  83. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4 12MB
  84. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.mp4 12MB
  85. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.mp4 12MB
  86. 07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.mp4 12MB
  87. 09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.mp4 12MB
  88. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4 11MB
  89. Assignments/11_Programming_Assignment_6/2sat5.txt 11MB
  90. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.mp4 11MB
  91. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.mp4 11MB
  92. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.mp4 11MB
  93. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4 10MB
  94. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.mp4 10MB
  95. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.mp4 10MB
  96. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.mp4 10MB
  97. 04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.mp4 10MB
  98. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4 10MB
  99. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.mp4 9MB
  100. Assignments/3_Programming_Assignment_2/clustering_big.txt 9MB
  101. 04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.mp4 9MB
  102. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4 9MB
  103. Assignments/11_Programming_Assignment_6/2sat4.txt 8MB
  104. 04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.mp4 8MB
  105. 04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.mp4 6MB
  106. Assignments/11_Programming_Assignment_6/2sat3.txt 6MB
  107. 09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.mp4 6MB
  108. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf 5MB
  109. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf 5MB
  110. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf 5MB
  111. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4 5MB
  112. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4 4MB
  113. 09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf 3MB
  114. 09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf 3MB
  115. 08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF.pdf 3MB
  116. 08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF.pdf 3MB
  117. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf 3MB
  118. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF.pdf 3MB
  119. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf 3MB
  120. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf 3MB
  121. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min_0_Slides_PDF.pdf 3MB
  122. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf 3MB
  123. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf 3MB
  124. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf 3MB
  125. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf 3MB
  126. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf 3MB
  127. 08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF.pdf 3MB
  128. 08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 3MB
  129. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf 3MB
  130. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf 3MB
  131. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf 3MB
  132. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf 3MB
  133. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf 3MB
  134. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF.pdf 3MB
  135. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf 3MB
  136. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf 3MB
  137. 09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf 3MB
  138. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf 3MB
  139. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf 3MB
  140. 08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf 3MB
  141. Assignments/11_Programming_Assignment_6/2sat2.txt 3MB
  142. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf 2MB
  143. 08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf 2MB
  144. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf 2MB
  145. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf 2MB
  146. 12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min_0_Slides_PDF.pdf 2MB
  147. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf 2MB
  148. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf 2MB
  149. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf 2MB
  150. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf 2MB
  151. 12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf 2MB
  152. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF.pdf 2MB
  153. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF.pdf 2MB
  154. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min_0_Slides_PDF.pdf 2MB
  155. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 2MB
  156. 08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 2MB
  157. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF.pdf 2MB
  158. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf 2MB
  159. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf 2MB
  160. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf 2MB
  161. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf 2MB
  162. 08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf 2MB
  163. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf 2MB
  164. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min_0_Slides_PDF.pdf 2MB
  165. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min_0_Slides_PDF.pdf 2MB
  166. 09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min_0_Slides_PDF.pdf 2MB
  167. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf 2MB
  168. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min_0_Slides_PDF.pdf 2MB
  169. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf 2MB
  170. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf 2MB
  171. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf 2MB
  172. 07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min_0_Slides_PDF.pdf 2MB
  173. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.mp4 2MB
  174. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf 2MB
  175. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf 2MB
  176. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf 2MB
  177. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf 2MB
  178. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf 2MB
  179. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf 2MB
  180. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf 2MB
  181. 09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf 2MB
  182. 08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf 2MB
  183. 04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf 2MB
  184. 07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf 2MB
  185. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf 2MB
  186. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf 2MB
  187. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf 2MB
  188. Assignments/3_Programming_Assignment_2/clustering1.txt 1MB
  189. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf 1MB
  190. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf 1MB
  191. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf 1MB
  192. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf 1MB
  193. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF.pdf 1MB
  194. 04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf 1MB
  195. 04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf 1MB
  196. entered_login.html 1MB
  197. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf 1MB
  198. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf 1MB
  199. Assignments/11_Programming_Assignment_6/2sat1.txt 1MB
  200. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF.pdf 1MB
  201. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf 1MB
  202. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf 1MB
  203. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF.pdf 1MB
  204. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf 1MB
  205. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf 1MB
  206. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf 1MB
  207. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf 1MB
  208. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf 1MB
  209. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min_0_Slides_PDF.pdf 1MB
  210. 04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf 950KB
  211. 04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min_0_Slides_PDF.pdf 944KB
  212. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf 862KB
  213. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF.pdf 844KB
  214. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf 812KB
  215. 09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf 808KB
  216. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf 770KB
  217. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf 752KB
  218. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf 731KB
  219. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf 729KB
  220. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf 660KB
  221. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.pdf 554KB
  222. Assignments/7_Programming_Assignment_4/g2.txt 498KB
  223. Assignments/7_Programming_Assignment_4/g1.txt 498KB
  224. Assignments/7_Programming_Assignment_4/g3.txt 498KB
  225. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf 461KB
  226. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf 433KB
  227. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.pdf 227KB
  228. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.pdf 227KB
  229. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf 221KB
  230. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf 209KB
  231. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.pdf 202KB
  232. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.pdf 195KB
  233. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.pdf 195KB
  234. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf 193KB
  235. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.pdf 189KB
  236. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.pdf 189KB
  237. 09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.pdf 184KB
  238. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.pdf 183KB
  239. 08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf 181KB
  240. 08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf 181KB
  241. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf 181KB
  242. 09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.pdf 173KB
  243. 09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.pdf 173KB
  244. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.pdf 173KB
  245. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.pdf 173KB
  246. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.pdf 167KB
  247. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.pdf 167KB
  248. 09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.pdf 164KB
  249. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.pdf 161KB
  250. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.pdf 161KB
  251. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf 161KB
  252. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.pdf 161KB
  253. 08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf 160KB
  254. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf 160KB
  255. 12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.pdf 157KB
  256. 08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.pdf 155KB
  257. 08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.pdf 155KB
  258. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf 152KB
  259. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf 152KB
  260. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf 152KB
  261. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf 152KB
  262. 08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.pdf 151KB
  263. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.pdf 148KB
  264. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.pdf 145KB
  265. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf 144KB
  266. Assignments/0_Problem_Set_1/0_Problem_Set_1.html 144KB
  267. 08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf 142KB
  268. 07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.pdf 142KB
  269. 12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.pdf 142KB
  270. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf 142KB
  271. 08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.pdf 141KB
  272. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.pdf 140KB
  273. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.pdf 139KB
  274. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.pdf 139KB
  275. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf 138KB
  276. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf 138KB
  277. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf 138KB
  278. 08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.pdf 137KB
  279. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.pdf 137KB
  280. 07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.pdf 134KB
  281. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.pdf 133KB
  282. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf 130KB
  283. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.pdf 130KB
  284. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.pdf 130KB
  285. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.pdf 128KB
  286. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf 128KB
  287. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.pdf 125KB
  288. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.pdf 125KB
  289. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.pdf 125KB
  290. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.pdf 125KB
  291. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf 122KB
  292. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.pdf 121KB
  293. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.pdf 121KB
  294. 04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.pdf 121KB
  295. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.pdf 119KB
  296. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.pdf 119KB
  297. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.pdf 118KB
  298. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.pdf 118KB
  299. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.pdf 114KB
  300. 04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.pdf 113KB
  301. Assignments/4_Problem_Set_3/4_Problem_Set_3.html 112KB
  302. 04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.pdf 112KB
  303. 04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.pdf 112KB
  304. 04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.pdf 112KB
  305. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.pdf 112KB
  306. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.pdf 111KB
  307. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.pdf 111KB
  308. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.pdf 110KB
  309. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.pdf 107KB
  310. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf 107KB
  311. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.pdf 105KB
  312. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.pdf 105KB
  313. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf 104KB
  314. Assignments/6_Problem_Set_4/6_Problem_Set_4.html 104KB
  315. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf 103KB
  316. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.pdf 102KB
  317. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf 102KB
  318. Assignments/10_Problem_Set_6/10_Problem_Set_6.html 101KB
  319. 09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.pdf 99KB
  320. Assignments.html 98KB
  321. Assignments/2_Problem_Set_2/2_Problem_Set_2.html 93KB
  322. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.pdf 93KB
  323. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.pdf 91KB
  324. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf 91KB
  325. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf 91KB
  326. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.pdf 91KB
  327. TheoryOptionalProblems/TheoryOptionalProblems.html 87KB
  328. 09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.pdf 86KB
  329. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.pdf 83KB
  330. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.pdf 82KB
  331. Assignments/8_Problem_Set_5/8_Problem_Set_5.html 78KB
  332. course_home.html 62KB
  333. Home/Home.html 62KB
  334. DiscussionForums/DiscussionForums.html 59KB
  335. Assignments/1_Programming_Assignment_1/jobs.txt 57KB
  336. Assignments/3_Programming_Assignment_2/3_Programming_Assignment_2.html 55KB
  337. Assignments/3_Programming_Assignment_2/zip_page.html 55KB
  338. Assignments/9_Programming_Assignment_5/9_Programming_Assignment_5.html 53KB
  339. Assignments/9_Programming_Assignment_5/zip_page.html 53KB
  340. Assignments/7_Programming_Assignment_4/7_Programming_Assignment_4.html 51KB
  341. Assignments/7_Programming_Assignment_4/zip_page.html 51KB
  342. Assignments/11_Programming_Assignment_6/11_Programming_Assignment_6.html 48KB
  343. Assignments/11_Programming_Assignment_6/zip_page.html 48KB
  344. Assignments/1_Programming_Assignment_1/1_Programming_Assignment_1.html 43KB
  345. Assignments/1_Programming_Assignment_1/zip_page.html 43KB
  346. Assignments/5_Programming_Assignment_3/5_Programming_Assignment_3.html 41KB
  347. Assignments/5_Programming_Assignment_3/zip_page.html 41KB
  348. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt 40KB
  349. Syllabus/Syllabus.html 38KB
  350. Tips/Tips.html 36KB
  351. CourseLogisticsAssessment/CourseLogisticsAssessment.html 35KB
  352. Final Exam.html 34KB
  353. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt 34KB
  354. FinalExam/0_Final_Exam/0_Final_Exam.html 32KB
  355. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.srt 31KB
  356. assignment_home.html 31KB
  357. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt 30KB
  358. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt 29KB
  359. Assignments/1_Programming_Assignment_1/edges.txt 28KB
  360. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt 27KB
  361. 09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.srt 26KB
  362. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.srt 25KB
  363. Assignments/5_Programming_Assignment_3/knapsack_big.txt 25KB
  364. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.srt 24KB
  365. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt 24KB
  366. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.srt 24KB
  367. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.srt 23KB
  368. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.srt 23KB
  369. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt 23KB
  370. 08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt 23KB
  371. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt 22KB
  372. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.srt 22KB
  373. 08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.srt 22KB
  374. 04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.srt 22KB
  375. 08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt 22KB
  376. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.srt 22KB
  377. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.srt 22KB
  378. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.srt 22KB
  379. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.srt 21KB
  380. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.srt 21KB
  381. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt 21KB
  382. 08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt 21KB
  383. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.srt 21KB
  384. 12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.srt 21KB
  385. 09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.srt 21KB
  386. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.txt 21KB
  387. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.srt 21KB
  388. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt 20KB
  389. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.srt 20KB
  390. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt 20KB
  391. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.srt 20KB
  392. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.srt 20KB
  393. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt 20KB
  394. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.srt 20KB
  395. 08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt 20KB
  396. 08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.srt 20KB
  397. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt 19KB
  398. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt 19KB
  399. 12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.srt 19KB
  400. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.srt 19KB
  401. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.srt 19KB
  402. 07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.srt 18KB
  403. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.srt 18KB
  404. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt 18KB
  405. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.srt 18KB
  406. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.srt 18KB
  407. 09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.txt 18KB
  408. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt 18KB
  409. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.srt 17KB
  410. 08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.srt 17KB
  411. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.srt 17KB
  412. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.txt 17KB
  413. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.srt 17KB
  414. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.srt 17KB
  415. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.srt 16KB
  416. 07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.srt 16KB
  417. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.srt 16KB
  418. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.txt 16KB
  419. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.srt 16KB
  420. 08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.srt 16KB
  421. 09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.srt 16KB
  422. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt 16KB
  423. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt 16KB
  424. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.txt 16KB
  425. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.srt 16KB
  426. 02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt 16KB
  427. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt 16KB
  428. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.srt 16KB
  429. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.txt 16KB
  430. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt 15KB
  431. 09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.srt 15KB
  432. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.srt 15KB
  433. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.txt 15KB
  434. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.srt 15KB
  435. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt 15KB
  436. 08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt 15KB
  437. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.txt 15KB
  438. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt 15KB
  439. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.srt 15KB
  440. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt 15KB
  441. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.srt 15KB
  442. 08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.txt 15KB
  443. 04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.txt 15KB
  444. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.srt 15KB
  445. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.txt 15KB
  446. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.txt 14KB
  447. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.srt 14KB
  448. 08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt 14KB
  449. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.srt 14KB
  450. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.txt 14KB
  451. 09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.srt 14KB
  452. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.txt 14KB
  453. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.srt 14KB
  454. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt 14KB
  455. 08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt 14KB
  456. 08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.srt 14KB
  457. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.txt 14KB
  458. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.srt 14KB
  459. 12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.txt 14KB
  460. 09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.txt 14KB
  461. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt 14KB
  462. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.txt 14KB
  463. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt 14KB
  464. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.txt 14KB
  465. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.srt 13KB
  466. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.srt 13KB
  467. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt 13KB
  468. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.txt 13KB
  469. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.srt 13KB
  470. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.txt 13KB
  471. 08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt 13KB
  472. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.srt 13KB
  473. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.txt 13KB
  474. 08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.txt 13KB
  475. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt 13KB
  476. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.txt 13KB
  477. 12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.txt 13KB
  478. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt 13KB
  479. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.srt 13KB
  480. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.srt 13KB
  481. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.srt 13KB
  482. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.txt 13KB
  483. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.srt 13KB
  484. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.txt 12KB
  485. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.srt 12KB
  486. 07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.txt 12KB
  487. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.txt 12KB
  488. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt 12KB
  489. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.txt 12KB
  490. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.txt 12KB
  491. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt 12KB
  492. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.txt 12KB
  493. 04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.srt 12KB
  494. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt 12KB
  495. 04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.srt 12KB
  496. 08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.txt 11KB
  497. 20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.txt 11KB
  498. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.srt 11KB
  499. 03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.txt 11KB
  500. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.txt 11KB
  501. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.srt 11KB
  502. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.srt 11KB
  503. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.txt 11KB
  504. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt 11KB
  505. 07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.txt 11KB
  506. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.txt 11KB
  507. 08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.txt 11KB
  508. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.txt 11KB
  509. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt 11KB
  510. 15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.txt 11KB
  511. 09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.txt 11KB
  512. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt 10KB
  513. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.txt 10KB
  514. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.txt 10KB
  515. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt 10KB
  516. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt 10KB
  517. 09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.txt 10KB
  518. 05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.txt 10KB
  519. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt 10KB
  520. 18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt 10KB
  521. 04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.srt 10KB
  522. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt 10KB
  523. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.txt 10KB
  524. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.txt 10KB
  525. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.txt 10KB
  526. 13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.srt 10KB
  527. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.txt 10KB
  528. 11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.txt 10KB
  529. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.txt 10KB
  530. 09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.txt 10KB
  531. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.txt 9KB
  532. 08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.txt 9KB
  533. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt 9KB
  534. 17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.txt 9KB
  535. 01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.txt 9KB
  536. 16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.txt 9KB
  537. 06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.txt 9KB
  538. 10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt 9KB
  539. 19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.txt 9KB
  540. 14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.txt 9KB