Канал: Karger Skoltech

Lecture 24 11/11: Online Algorithms: Paging

Lecture 24 11/11: Online Algorithms: Paging

Lecture 22 11/04 Approximation Algorithms: Linear Programming Relaxations

Lecture 22 11/04 Approximation Algorithms: Linear Programming Relaxations

Lecture 21 11/01 Approximation Algorithms: Relaxations

Lecture 21 11/01 Approximation Algorithms: Relaxations

Lecture 20 10/30 Polynomial Approximation Schemes

Lecture 20 10/30 Polynomial Approximation Schemes

Lecture 19 10/28 Approximation Algorithms

Lecture 19 10/28 Approximation Algorithms

Lecture 18 10/25 Linear Programming: Interior Point

Lecture 18 10/25 Linear Programming: Interior Point

Lecture 17 10/23 Linear Programming: Simplex Algorithm

Lecture 17 10/23 Linear Programming: Simplex Algorithm

Lecture 16 10/21 Linear Programming Duality Examples

Lecture 16 10/21 Linear Programming Duality Examples

Lecture 15 10/18 Linear Programming Duality

Lecture 15 10/18 Linear Programming Duality

Lecture 14 10/16 Linear Programming

Lecture 14 10/16 Linear Programming

Lecture 13 10/11 Linear Programming

Lecture 13 10/11 Linear Programming

Lecture 12 10/09 Min Cost Flow Algorithms

Lecture 12 10/09 Min Cost Flow Algorithms

Lecture 11, 10/07: Min-cost Flows

Lecture 11, 10/07: Min-cost Flows

Lecture 10, 10/02: Network Flow Algorithms

Lecture 10, 10/02: Network Flow Algorithms

Lecture 09, 09/30: Augmenting Path Algorithms

Lecture 09, 09/30: Augmenting Path Algorithms

Lecture 07, 09/23: Perfect Hashing

Lecture 07, 09/23: Perfect Hashing

Lecture 06, 09/18: Hashing

Lecture 06, 09/18: Hashing

Lecture 05, 09/16: Integer Shortest Paths

Lecture 05, 09/16: Integer Shortest Paths

Lecture 04, 09/13: Splay Trees

Lecture 04, 09/13: Splay Trees

Lecture 08, 09/25: Network Flows

Lecture 08, 09/25: Network Flows