18:11
CS 5720 L27 05 Final Review Complexity Theory
13:28
CS 5720 L27 04 Final Review Greedy Algorithms
15:50
CS 5720 L27 03 Final Review Dynamic Programming
15:23
CS 5720 L27 02 Final Review Divide and Conquer
09:58
CS 5720 L26 03 Knapsack FPTAS
15:10
CS 5720 L26 02 Knapsack PTAS
09:01
CS 5720 L26 01 PTAS
11:24
CS 5720 L27 01 Final Review - Preliminaries
20:29
Providing Slowdown Information to Improve Selfish Routing
26:55
Local Utility Redesign for Multiagent Optimization: GAMES 2021
11:57
When Altruism is Worse than Anarchy in Nonatomic Congestion Games: ACC 2021
54:16
CS 4-5730 Lecture 04 Stable Matching 2
01:02:46
CS 4 5730 Lecture 04 Stable Matching
14:08
CS 5720 L25 04 Knapsack 2 Approximation
14:25
CS 5720 L25 03 Christofides and 2OPT
15:57
CS 5720 L25 02 MST Algorithms
08:38
CS 5720 L25 01 Euclidean TSP
24:12
CS 5720 L24 03 Inapproximability of TSP
10:14
CS 5720 L24 02 Approximation Algorithms
09:45
CS 5720 L24 01 Approximation Concepts
16:32
CS 5720 L23 04 NP Complete
10:48
CS 5720 L23 03 Concrete Example
16:04
CS 5720 L23 05 Resolving P vs NP
15:15
CS 5720 L23 02 Polynomial Reduction
16:09
CS 5720 L22 05 HC and EC
06:22
CS 5720 L22 04 P subset of NP
11:22
CS 5720 L22 03 Class NP
11:27
CS 5720 L22 02 Class P
07:17
CS 5720 L22 01 Sorting Asymmetry
10:08
CS 5720 L21 05 Counting Sort
10:54
CS 5720 L21 04 N Log N
17:35
CS 5720 L21 03 Decision Tree
09:29
CS 5720 L21 02 Trivial and Tight Lower Bounds
13:03
CS 5720 L21 01 Intro Lower Bounds
12:09
CS 5720 L23 01 P vs NP
08:13
CS 5720 L20 04 Kruskal
21:36
CS 5720 L20 03 Prim Correctness
13:28
CS 5720 L20 02 Prim Intro
15:19
CS 5720 L20 01 MST Intro
15:09
CS5720 L19 06 Dijkstra Complexity 2
15:47
CS5720 L19 05 Dijkstra Complexity 1
08:52
CS5720 L19 04 Dijkstra Correctness
13:57
CS5720 L19 03 Dijkstra runthrough
08:46
CS5720 L19 02 shortest paths as spanning tree
10:48
CS5720 L19 01 Dijkstra Intro
16:08
CS5720 L18 05 Correctness Proof
16:57
CS5720 L17 04 Held Karp Correct Analysis
11:34
CS5720 L18 03 Fractional Knapsack
08:03
CS5720 L18 02 Greedy and DP
17:42
CS5720 L18 04 Greedy Fractional Knapsack
10:06
CS5720 L18 01 Greedy Intro
14:27
CS5720 L17 03 Held Karp Naive Analysis
09:06
CS5720 L17 02 Held Karp Math
13:06
CS5720 L17 01 Held Karp Intro
13:06
CS 5720 L16 07 Knapsack Complexity and Pseudopolynomial
20:17
CS 5720 L16 06 Knapsack Top Down
24:27
CS 5720 L16 05 DP Knapsack Example
10:50
CS 5720 L16 04 DP Knapsack Algorithm
14:38
CS 5720 L16 03 DP Knapsack Math
07:05
CS 5720 L16 02 Knapsack Case 2 Intuition
X
About
Tags