Sumários

10 Maio 2022, 18:30 • Ana Respicio

Exercises from Chapter 7 of Kleinberg and Tardos - Network Flows.

10 Maio 2022, 16:30 • Ana Respicio

Network flow. The maximum flow problem and the Ford-Fulkerson algorithm. Maximum flows and minimum cuts in a flow network.

3 Maio 2022, 18:30 • Ana Respicio

Exercises on Divide-and-conquer.

3 Maio 2022, 16:30 • Ana Respicio

Divide.and-Conquer

26 Abril 2022, 18:30 • Ana Respicio

Exercise 2 on Dynamic Programming.