Översikt

    • Sida icon
      Lecture 1 (9 January): Introduction. Algorithms and Structures Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 2 (16 January): Graph Coloring Sida
      Tillgänglig om: You are a(n) Studerande

      In this class, we will go through some classical greedy and local recoloring based algorithms for graph coloring.


    • Sida icon
      Lecture 3 (23 January): Matching Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 4 (30 January): Compression of graphs Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 5&6 (6, 13 February): Treewidth Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 7 (27 February): Randomized Algorithm for Matching & Intro to Probability Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 8 (13 March): Probabilistic Method. Linearity of Expectations. Alterations. Chernoff Bounds Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 9 (20 March): Lovasz Local Lemma and Satisfiability Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 10 (27 March): Optimal Packet Routing. Sida
      Tillgänglig om: You are a(n) Studerande
    • Sida icon
      Lecture 11 (3 April): Final exam information & project discussions Sida
      Tillgänglig om: You are a(n) Studerande