Completed
Jan Van den Brand: From Interior Point Methods to Data Structures and back
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Continuous Approaches to Discrete Optimization
Automatically move to the next video in the Classroom when playback concludes
- 1 Jan Van den Brand: From Interior Point Methods to Data Structures and back
- 2 Rasmus Kyng: A numerical analysis approach to convex optimization
- 3 Yang Liu: Fully Dynamic Electrical Flows: Sparse Maxflow Faster than Goldberg-Rao
- 4 Debmalya Panigrahi: Isolating Cuts: A New Tool for Minimum Cut Algorithms
- 5 Sorrachai Yingchareonthawornchai: Approximating k-Edge-Connected Spanning Subgraphs via a Fast [...]
- 6 Kent Quanrud: On Iterative Peeling and Supermodularity for Densest Subgraph
- 7 Sally Dong: Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
- 8 Bento Natura: Fast Exact Solvers for Linear Programs via Interior Point Methods
- 9 Jacek Gondzio: Applying interior point algorithms in column generation and cuttingplane methods
- 10 Andrea Lodi: Cutting Plane Generation Through Sparse Principal Component Analysis
- 11 Jens Vygen: Continuous approaches to VLSI routing
- 12 Robert Luce: Local and global solution of nonconvex quadratic problems
- 13 Aaron Sidford: Unit Capacity Maximum Flow in Almost m^(4/3) Time
- 14 Rico Zenklusen, Vera Traub: Bridging the Gap Between Tree and Connectivity Augmentation
- 15 Matthias Mnich: Approximation Algorithms for Hard Cut Problems via Continuous Relaxations
- 16 Sebastian Pokutta: A distributed accelerated algorithm for the 1-fair packing problem
- 17 Stefan Weltge: Speeding up the Cutting Plane Method?
- 18 Zhao Song: Fast Iterative Algorithm via Nearest/Furthest Neighbor Search
- 19 Alina Ene: Adaptive gradient descent methods for constrained optimization
- 20 Jelena Diakonikolas: Local Acceleration of Frank-Wolfe Methods
- 21 Roie Levin: Random Order Set Cover is as Easy as Offline
- 22 Gerard Cornuejols: Dyadic linear programming
- 23 Ola Svensson: Learning-Augmented Online Algorithms and the Primal-Dual Method
- 24 Anupam Gupta: Covering LP Relaxations for k-Server
- 25 Sebastian Bubeck: Chasing small sets
- 26 Haotian Jiang: Minimizing Convex Functions with Integral Minimizers
- 27 Deeparnab Chakrabarty: Polynomial Lower Bounds for Parallel Submodular Function Minimization
