Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem I: Electrical Flows a

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=PuTAPleIaqw


Duration: 1:11:14
1,067 views
10

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



Other Videos By Simons Institute for the Theory of Computing


2014-09-12Writing Down Polynomials via Representation Theory I
2014-09-12Tensors vs Entanglement
2014-09-12Introduction to Geometric Complexity Theory II
2014-09-12Circuits of Bounded Depth
2014-09-12Tensor Decomposition I
2014-09-12Introduction to Geometric Complexity Theory I
2014-09-12Solving Polynomials I
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem III: Maximum Flows an
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem II: Approximating Max
2014-09-05Semidefinite Programming Hierarchies III: Applications of the Sum-of-Squares Method
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem I: Electrical Flows a
2014-09-05Laplacian Systems and Electrical Flows I: Intro to Laplacian Systems, Iterative Methods, and Precond
2014-09-05Laplacian Systems and Electrical Flows II: Solving Laplacian Systems Using Recursive Preconditioning
2014-09-05Graph Sparsification I: Sparsification via Effective Resistances
2014-09-05Spectral Graph Theory I: Introduction to Spectral Graph Theory
2014-09-05Spectral Graph Theory III: Small-set Expanders, Clustering, and Eigenvalues
2014-09-05Graph Sparsification III: Interlacing Polynomials and Ramanujan Graphs of Every Degree
2014-09-05Laplacian Systems and Electrical Flows III: A Simple, Combinatorial Solver without Recursive Precond
2014-09-05Semidefinite Programming Hierarchies I: Convex Relaxations for Hard Optimization Problems
2014-09-05Semidefinite Programming Hierarchies II: Hierarchies of Relaxations and their Strengths and Limitati
2014-09-05Graph Sparsification II: Barrier Functions and Rank-one Updates


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Aleksander Mądry