Lecture6

The document summarizes a lecture on packet routing algorithms for hypercubes, including analyzing the expected time for a random routing algorithm to route packets from source to destination in two phases. It then discusses primal-dual algorithms for solving multi-commodity flow problems on networks and how they maintain constraints for both the primal and dual optimization problems through an iterative process of adjusting primal and dual variables.