Cut-Approximators, Approximating Undirected Max Flows, and Recursion

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


Duration: 41:32
1,010 views
7

Richard Peng, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/richard-peng-2014-12-05



Other Videos By Simons Institute for the Theory of Computing


2014-12-08Gaussian Free Fields and Computing the Cover Time
2014-12-08Sketching as a Tool for Numerical Linear Algebra
2014-12-08An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicom...
2014-12-08Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities
2014-12-08Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
2014-12-08Solving $1$-Laplacians of Convex Simplicial Complexes
2014-12-08The Sketching Complexity of Graph Cuts
2014-12-08Generalized Cheeger Inequalities and Constrained Clustering
2014-12-08Empirical Complexity of Laplacian Solvers: A Discussion
2014-12-08You can be a World Champion!
2014-12-08Cut-Approximators, Approximating Undirected Max Flows, and Recursion
2014-12-03Tensors: A Geometric View
2014-11-21Kronecker Coefficients — Computation and Bounds
2014-11-21A Few Computational Tools for Tensor Rank and Tensor Decomposition
2014-11-21Computing Sheaf Cohomology for Products of Projective Spaces
2014-11-21Tensors, Secant Varieties and Interpolation
2014-11-21Geometry of Symmetric Bivariate Tensors of Fixed Typical Rank
2014-11-21Macaulay 2 Tutorial I
2014-11-21Macaulay 2 Tutorial II
2014-11-21Schemes Associated with Eigenvectors of Tensors
2014-11-21Parliaments of Polytopes and Toric Vector Bundles


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Richard Peng