Fall 2023: Theory of Network Design

This is a proof-based course that lies at the intersection of algorithms and graph theory. We will tour through some classic algorithms and cutting-edge work in the area of network design. Topics will include distance oracles, spanners, emulators, preservers, shortcut sets, hopsets, algorithmic applications of these objects, and methods for making these objects tolerant to temporary failures in a network.