Index of /videos/courses/algo2-2012-001

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[TXT]lectures.html2013-12-16 14:52 241K 
[TXT]idx.html2013-12-16 14:52 41K 
[ ]algo2-2012-001-about.json2013-12-16 14:52 13K 
[DIR]20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2013-12-16 15:11 -  
[DIR]19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2013-12-16 15:10 -  
[DIR]18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2013-12-16 15:09 -  
[DIR]17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2013-12-16 15:08 -  
[DIR]16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2013-12-16 15:07 -  
[DIR]15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2013-12-16 15:06 -  
[DIR]14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2013-12-16 15:05 -  
[DIR]13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2013-12-16 15:03 -  
[DIR]12 - XII. SEQUENCE ALIGNMENT (Week 3)/2013-12-16 15:02 -  
[DIR]11 - XI. THE KNAPSACK PROBLEM (Week 3)/2013-12-16 15:02 -  
[DIR]10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2013-12-16 15:01 -  
[DIR]09 - IX. HUFFMAN CODES (Week 2)/2013-12-16 15:00 -  
[DIR]08 - VIII. ADVANCED UNION-FIND (Week 2)/2013-12-16 15:00 -  
[DIR]07 - VII. CLUSTERING (Week 2)/2013-12-16 14:58 -  
[DIR]06 - VI. KRUSKALS MINIMUM SPANNING TREE ALGORITHM (Week 2)/2013-12-16 14:57 -  
[DIR]05 - V. PRIMS MINIMUM SPANNING TREE ALGORITHM (Week 1)/2013-12-16 14:56 -  
[DIR]04 - IV. A SCHEDULING APPLICATION (Week 1)/2013-12-16 14:55 -  
[DIR]03 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2013-12-16 14:55 -  
[DIR]02 - II. SELECTED REVIEW FROM PART I (Week 1)/2013-12-16 14:54 -  
[DIR]01 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2013-12-16 14:52 -