Brian presented on combinatorial optimization, specifically, some approximation algorithms for the (metric) traveling salesman problem.

The best1 among them, Christofides Algorithm, creatively combines many other classic graph algorithms.

  1. I might be lying; come to find out why. ↩

Previous: Sampling a Gaussian Markov random field on a torus

For Valentine’s day, Stephen talked about efficient algorithms for sampling a stationary random field defined on a torus. Sugar-topped flour tori will be provided.

continue reading ❯