Skip to main content

Teaching Talks

  1. S-T connectivity in O(log(n)) space and random walks
  2. A simple explanation of the GW primal-dual for Steiner Forest
  3. A very simple explanaton Dual-fitting of Lovats for Set Cover
  4. A simple charging scheme for the algorithm of Jain for Steiner Network
  5. A simple explanation of the Positive Semi-Definite approximation for Max-Cut
  6. The Directed Multicut problem
  7. Exact solutions and approximations via LP
  8. Approximating the undirected Multicut problem