Speakers of the Course
Amos Fiat, School of Computer Science, Tel Aviv University, Israel
Networks, Crowds, Markets, and Matchings (SLIDES+HOMEWORK)
Alexandr Andoni, Microsoft Research Silicon Valley, California
Sampling in Graphs (SLIDES) (HOMEWORK)
Antonio Frangioni, University of Pisa, Italy Nonlinear Aspects of Routing in Telecommunication Networks (SLIDES+HOMEWORK)
Andrew V. Goldberg, Microsoft Research Silicon Valley, California The Hub Labeling Algorithm (SLIDES)
Giuseppe F. Italiano, University of Rome 'Tor Vergata', Italy Biconnectiviy in Directed Graphs (SLIDES)
Aleksander Madry, Federal Polytechnic of Lausanne, Switzerland Electrical Flows, Laplacian Matrices, and New Approaches to the Maximum Flow Problem (SLIDES) (HOMEWORK)
Alexander Martin, University of Erlangen-Nuremberg, Germany Mixed Integer Programming for Energy Networks (SLIDES)
Giovanni Rinaldi, IASI-CNR, Rome, Italy Efficient algorithms for NP-hard combinatorial problems (SLIDES)
Maria Grazia Speranza, University of Brescia, Italy Graphs and the value of integration in logistics (SLIDES)
Robert Tarjan, Princeton University and Microsoft Research New Results and Open Problems in Data Structures (SLIDES)
Paolo Toth, University of Bologna, Italy Graph Theory Models and Algorithms for the solution of Railway Optimization Problems (SLIDES)
David P. Williamson, Cornell University, Ithaca New York Approximation Algorithms for the Traveling Salesman Problem
|