Ranked #1
Set cover finished (11.3); weighted vertex cover 11.4
Set cover finished (11.3); weighted vertex cover 11.4
20 Jan 2009
•
1hr 23mins
Ranked #2
Linear programming/integer programming
Linear programming/integer programming
20 Jan 2009
•
1hr 22mins
Similar Podcasts
Ranked #3
Approximations for: disjoint paths 11.5, 11.8 knapsack
Approximations for: disjoint paths 11.5, 11.8 knapsack
20 Jan 2009
•
1hr 22mins
Ranked #4
Hard problems: NP, decision vs. optimization, subset sum reductions
Hard problems: NP, decision vs. optimization, subset sum reductions
20 Jan 2009
•
1hr 24mins
Ranked #5
Advanced graph algorithms
Advanced graph algorithms
20 Jan 2009
•
1hr 23mins
Ranked #6
Finish 6.5; sequence alignment (6.6); linear space (6.7)
Finish 6.5; sequence alignment (6.6); linear space (6.7)
16 Jan 2009
•
1hr 25mins
Ranked #7
Introduction: Types of analysis
Introduction: Types of analysis
16 Jan 2009
•
1hr 23mins
Ranked #8
Local search (12.1); simulated annealing (brief) (12.2)
Local search (12.1); simulated annealing (brief) (12.2)
20 Jan 2009
•
1hr 18mins
Ranked #9
Randomized Max-SAT (13.4); universal hashing (13.6); perfect hashing (CLRS 11.5)
Randomized Max-SAT (13.4); universal hashing (13.6); perfect hashing (CLRS 11.5)
20 Jan 2009
•
1hr 21mins
Ranked #10
Network Flows (7.1, 7.2): Problem definition, residual graphs, Ford-Fulkerson algorithm
Network Flows (7.1, 7.2): Problem definition, residual graphs, Ford-Fulkerson algorithm
16 Jan 2009
•
1hr 21mins