Flows in Networks-Slides and Resources on Flows in Networks
About University
Slides and Resources on Flows in Networks
Flows in Networks-Flows in Networks
Introduction
()
Network Flows
()
Flows in Networks-Basic Tools
Residual Networks
()
Maxflow-Mincut
()
Flows in Networks-Maxflow Algorithms
The Ford–Fulkerson Algorithm
()
Slow Example
()
The Edmonds–Karp Algorithm
()
Flows in Networks-Applications
Bipartite Matching
()
Image Segmentation
()
Flows in Networks-End of Module Quiz
Rules on the academic integrity in the course
Flows in Networks-Programming Assignment
Available Programming Languages
FAQ on Programming Assignments
Linear Programming-Slides and Resources on Linear Programming
Slides and Resources on Linear Programming
Linear Programming-Introduction
Introduction
()
Linear Programming
()
Linear Algebra: Method of Substitution
()
Linear Algebra: Gaussian Elimination
()
Linear Programming-Basic Tools
Convexity
()
Duality
()
(Optional) Duality Proofs
()
Linear Programming-Algorithms
Linear Programming Formulations
()
The Simplex Algorithm
()
(Optional) The Ellipsoid Algorithm
()
NP-complete Problems-Slides and Resources on NP-complete Problems
Slides and Resources on NP-complete Problems
NP-complete Problems-Search Problems
Brute Force Search
()
Search Problems
()
Traveling Salesman Problem
()
Hamiltonian Cycle Problem
()
Longest Path Problem
()
Integer Linear Programming Problem
()
Independent Set Problem
()
P and NP
()
NP-complete Problems-Reductions
Reductions
()
Showing NP-completeness
()
Independent Set to Vertex Cover
()
3-SAT to Independent Set
()
SAT to 3-SAT
()
Circuit SAT to SAT
()
All of NP to Circuit SAT
()
Using SAT-solvers
()
Minisat Installation Guide
Coping with NP-completeness-Slides and Resources on Coping with NP-completeness
Slides and Resources on Coping with NP-completeness
Coping with NP-completeness-Introduction
Introduction
()
Coping with NP-completeness-Special Cases
2-SAT
()
2-SAT: Algorithm
()
Independent Sets in Trees
()
Coping with NP-completeness-Exact Algorithms
3-SAT: Backtracking
()
3-SAT: Local Search
()
TSP: Dynamic Programming
()
TSP: Branch and Bound
()
Coping with NP-completeness-Approximation Algorithms
Vertex Cover
()
Metric TSP
()
TSP: Local Search
()
Streaming Algorithms (Optional)-Finding Heavy Hitters in Data Streams
Introduction
()
Heavy Hitters Problem
()
Reduction 1
()
Reduction 2
()
Basic Estimate 1
()
Basic Estimate 2
()
Final Algorithm 1
()
Final Algorithm 2
()
Proofs 1
()
Proofs 2
()