15-850 CMU Advanced Algorithms

• 02 Nov 2018 » Lecture 28: Prophets and Secretaries
  
  
• 31 Oct 2018 » Lecture 26 and 27: SDPs and SoS
  
  
• 26 Oct 2018 » Lecture 25 (and also Lecture 22): Method of Lagrange Multipliers
  
  
• 24 Oct 2018 » Lecture 24: Online Algorithms
  
  
• 22 Oct 2018 » Lecture 23: Approximation
  
  
• 17 Oct 2018 » Lecture 22: Overview of Interior-Point Methods
  
  
• 10 Oct 2018 » Lecture 19: Mirror Descent
  
  
• 05 Oct 2018 » Lecture 17: Solving Max-Flow using Multiplicative Weights
  
  
• 03 Oct 2018 » Lecture 16: Solving LPs using Multiplicative Weights
  
  
• 28 Sep 2018 » Lecture 14: Applications of Concentration Inequalities
  
  
• 26 Sep 2018 » Lecture 13: Treewidth and Planarity
  
  
• 24 Sep 2018 » Lecture 12: FPT Algorithms
  
  
• 21 Sep 2018 » Lecture 11: Singular Value Decompositions
  
  
• 21 Sep 2018 » Lecture 11 (contd.): Singular Value Decompositions
  
  
• 17 Sep 2018 » Lecture 9: Large-Deviation Bounds
  
  
• 14 Sep 2018 » Lecture 8: Matchings via Algebraic Techniques
  
  
• 12 Sep 2018 » Lecture 7: Matchings via Linear Programming
  
  
• 07 Sep 2018 » Lecture 5: Low-Stretch Spanning Trees (and Low-Diameter Decompositions)
  
  
• 05 Sep 2018 » Lecture 4: Shortest-Paths
  
  
• 31 Aug 2018 » Lecture 3: Dynamic Connectivity and Data Structures
  
  
• 29 Aug 2018 » Lecture 2: Min-Cost Arborescences