Publishers
Charts
Log in
Design and Analysis of Algorithms (Fall, 2008)
Episodes
Local search (12.1); simulated annealing (brief) (12.2)
Published 01/20/09
Randomized Max-SAT (13.4); universal hashing (13.6); perfect hashing (CLRS 11.5)
Published 01/20/09
Closest point (13.7); introduction to primality testing
Published 01/20/09
Primality testing (see Cormen, Leiserson, Rivest 31.8)
Published 01/20/09
Midterm solutions
Published 01/20/09
Set cover finished (11.3); weighted vertex cover 11.4
Published 01/20/09
Linear programming/integer programming
Published 01/20/09
Approximations for: disjoint paths 11.5, 11.8 knapsack
Published 01/20/09
Pspace (9.1,9.2); dealing with hard problems
Published 01/20/09
10.2 Independent set; approximations: vertex cover, scheduling 11.1
Published 01/20/09
Hard problems: NP, decision vs. optimization, subset sum reductions
Published 01/20/09
Advanced graph algorithms
Published 01/20/09
Network flow applications
Published 01/20/09
Finish 6.5; sequence alignment (6.6); linear space (6.7)
Published 01/16/09
Linear space analysis (6.7); shortest paths (6.8-6.9, bit of 6.10)
Published 01/16/09
Introduction: Types of analysis
Published 01/16/09
Network Flows (7.1, 7.2): Problem definition, residual graphs, Ford-Fulkerson algorithm
Published 01/16/09
Network flows: Scaling algorithm, application to bipartite matching, disjoint paths (7.3, 7.5, 7.6)
Published 01/16/09
Design and Analysis of Algorithms (Fall, 2008)
Published 01/16/09
Listen now
All episodes
All reviews
More from Charles U. Martel
Links
No website
No RSS feed
Listen on Apple Podcasts
Twitter
Facebook
Instagram
Patreon
Genres
Technology
Artwork or description wrong?
Request an update »
Updates may take a few minutes.
Do you host a podcast?
Track your ranks and reviews from Spotify, Apple Podcasts and more.
See hourly chart positions and more than 30 days of history.
Get Chartable Analytics »