Algorithmique et Programmation Avancée (M1, Paris Dauphine)

General Information: this is a joint-course with Eric Benhamou. For the theoretical part, we will mostly use the textbook "Algorithm Design" by Kleinberg and Tardos.

Office Hours: Tuesday 14h-16h (or by appointment)
Teaching Assistant: Sofia Vazquez

Diary of our class.

Sep 12: we talked about greedy algorithms.

Sep 19: we presented dynamic programming.

Sep 26: we gave a short introduction to reduction and maximum flow.

Oct 3: we showed the capacity-scaling algorithm and an application of maximum flow.

Nov 14: we discussed Karger's global min-cut algorithm and center selection problem.

Nov 28: we talked about knapsack, edge-disjoint paths, and travelling salesman.