Ranked #1
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm
In Lecture 10, students learn about Dijkstra's algorithm for shortest paths in a graph with non-negative edge weights.
15 Oct 2010
•
51mins
Ranked #2
Greedy algorithms: The classroom scheduling problem
Greedy algorithms: The classroom scheduling problem
In Lecture 9A, Gusfield provides another scheduling problem to be solved by a greedy algorithm.
14 Oct 2010
•
16mins
Similar Podcasts
Algorithms + Data Structures = Programs
All-In with Chamath, Jason, Sacks & Friedberg
The Jordan B. Peterson Podcast
Ranked #3
Greedy algorithms: Picking largest set of non-overlapping intervals
Greedy algorithms: Picking largest set of non-overlapping intervals
For Lecture 9, Gusfield starts discussion of greedy algorithms: Picking the largest number of non-overlapping intervals ... Read more
13 Oct 2010
•
50mins
Ranked #4
Start of minimum spanning tree problem
Start of minimum spanning tree problem
In Lecture 11, Gusfield covers Prim's algorithm and analysis, and Kruskal's algorithm.
18 Oct 2010
•
49mins
Most Popular Podcasts
The Joe Rogan Experience
TED Talks Daily
The Tim Ferriss Show
The Daily
Stuff You Should Know
Oprah's SuperSoul Conversations
Armchair Expert with Dax Shepard
Ranked #5
Introduction to approximation algorithms
Introduction to approximation algorithms
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
17 Nov 2010
•
47mins
Ranked #6
Linear-time pattern matching. Z-values and Z-algorithm
Linear-time pattern matching. Z-values and Z-algorithm
In Lecture 21, Gusfield covers linear-time pattern matching. He also discusses Z-values and Z-algorithms.
12 Nov 2010
•
51mins
Ranked #7
Unique-Decipherability. Graph algorithm and proof of correctness
Unique-Decipherability. Graph algorithm and proof of correctness
Lecture 20 deals with unique-decipherability: efficient graph-based algorithm and proof of correctness.
10 Nov 2010
•
51mins
Ranked #8
The unique-decipherability problem
The unique-decipherability problem
Lecture 19 covers the unique-decipherability problem and gives definitions and the start of a graph-based solution.
8 Nov 2010
•
52mins
Ranked #9
Floyd-Warshall algorithm for all-pairs shortest path
Floyd-Warshall algorithm for all-pairs shortest path
In Lecture 18, Gusfield discusses Floyd-Warshall, the algorithm for computing the shortest path in a weighted graph betw... Read more
5 Nov 2010
•
48mins
Ranked #10
Dynamic programming for shortest path problem
Dynamic programming for shortest path problem
Lecture 17 covers dynamic programming for the shortest path problem in a weighted directed graph, as well as negative ed... Read more
3 Nov 2010
•
37mins
