The Revolution in Graph Theoretic Optimization

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


Duration: 55:02
1,043 views
9

Gary Miller, Carnegie Mellon University
Simons Institute Open Lectures
http://simons.berkeley.edu/events/openlectures2014-fall-2



Other Videos By Simons Institute for the Theory of Computing


2014-10-21Matrix Completion for the Independence Model
2014-10-21Mixed Volume Computation in (another) Mixed Volume Time
2014-10-21Chordal Structure and Polynomial Systems
2014-10-21Some Results and Questions as to the Complexity of the (Eigenvalue, Eigenvector) Problem
2014-10-21Real Algebraic Geometry in Computational Game Theory
2014-10-21On the Complexity of Solving Bivariate Systems
2014-10-21Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical ...
2014-10-21Descartes' Rule of Signs for Polynomial Systems Supported on Circuits
2014-10-21Solvability of Systems of Polynomial Equations over Finite Fields
2014-10-20Profile of Luca Trevisan, the Simons Institute's Incoming Senior Scientist
2014-10-07The Revolution in Graph Theoretic Optimization
2014-09-29Serialrank: Spectral Ranking using Seriation
2014-09-29Convex Optimization and Quantum Information
2014-09-29Faster SDP Hierarchy Solvers for Local Rounding Algorithms
2014-09-29Tensor Decompositions: Uniqueness and Smoothed Analysis
2014-09-29Convex Relaxations for Recovering Simultaneously Structured Objects
2014-09-29An SDP-based Algorithmic Cheeger Inequality for Vertex Expansion
2014-09-29Spectral Bounds and SDP Hierarchies for Geometric Packing Problems
2014-09-29A Polynomial Time Algorithm for Lossy Population Recovery
2014-09-29Learning Overcomplete Latent Variable Models through Tensor Power Method
2014-09-29Recovering Hidden Sparsity via Sum of Squares


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Gary Miller