Playlist: 15 videos

Algorithmic Spectral Graph Theory Boot Camp

Aug. 26 – Aug. 29, 2014

The Boot Camp is intended to acquaint program participants with the key themes of the program. Each speaker will give a sequence of three lectures on the topics below. All talks will be recorded.

Luca Trevisan (UC Berkeley)...

1:0:37

Laplacian Systems and Electrical Flows III: A Simple, Combinatorial Solver without Recursive Preconditioning

Jon Kelner, Massachusetts Institute of Technology
Algorithmic Spectral Graph Theory Boot Camp
http://simons.berkeley.edu/talks/jon-kelner-2014-08-28b
Visit talk page
1:11:14

Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem I: Electrical Flows as a New Primitive for Graph Algorithms

Aleksander Mądry, École Polytechnique Fédérale de Lausanne
Algorithmic Spectral Graph Theory Boot Camp
http://simons.berkeley.edu/talks/aleksander-madry-2014-08-28
Visit talk page
0:57:23

Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem II: Approximating Maximum Flow with Electrical Flows

Aleksander Mądry, École Polytechnique Fédérale de Lausanne
Algorithmic Spectral Graph Theory Boot Camp
http://simons.berkeley.edu/talks/aleksander-madry-2014-08-29a
Visit talk page
0:56:57

Semidefinite Programming Hierarchies III: Applications of the Sum-of-squares Method

David Steurer, Cornell University
Algorithmic Spectral Graph Theory Boot Camp
http://simons.berkeley.edu/talks/david-steurer-2014-08-29
Visit talk page
1:13:7

Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem III: Maximum Flows and Interior-point Methods

Aleksander Mądry, École Polytechnique Fédérale de Lausanne
Algorithmic Spectral Graph Theory Boot Camp
http://simons.berkeley.edu/talks/aleksander-madry-2014-08-29b
Visit talk page