Lecture

Ford-Fulkerson Method

Related lectures (28)

Network Flows and LP Formulations Log in to Mediaspace to watch this video

Explains network flows, LP formulations, simplex method, duality, and practical applications.

Max-Cut Problem: SDP Relaxation and Randomized Rounding Log in to Mediaspace to watch this video

Explores the Max-Cut Problem, its relaxation using SDP, and Polynomial Optimization.

Semi-Definite Programming Log in to Mediaspace to watch this video

Covers semi-definite programming and optimization over positive semidefinite cones.

Network Flows Meets Simplex Log in to Mediaspace to watch this video

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Simplex Algorithm: Basics Log in to Mediaspace to watch this video

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

Quantum Approximate Optimization Algorithm Log in to Mediaspace to watch this video

Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.

Cheeger's Inequality Log in to Mediaspace to watch this video

Explores Cheeger's inequality and its implications in graph theory.

Algorithmic Paradigms for Dynamic Graph Problems Log in to Mediaspace to watch this video

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.