Theory of Computation Laboratory 2: Resource Allocation and Network Design

This lecture covers approximation algorithms for resource allocation problems like the Santa Claus problem and makespan scheduling, as well as for network design problems such as the Traveling Salesman and Steiner forest. It also delves into learning augmented algorithms with predictions, discussing competitive algorithms for the TCP acknowledgment problem and experimental results.