Listen Top Shows Blog

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Update: 2017-01-03

Share

Description

In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem.

Comments

In Channel

Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting

Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting

2017-01-0301:17:41

Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices

Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices

2017-01-0301:20:27

Recitation 11: Cryptography: More Primitives

Recitation 11: Cryptography: More Primitives

2017-01-0349:30

Lecture 22: Cryptography: Encryption

Lecture 22: Cryptography: Encryption

2017-01-0301:24:14

Lecture 21: Cryptography: Hash Functions

Lecture 21: Cryptography: Hash Functions

2017-01-0301:22:00

Recitation 10: Distributed Algorithms

Recitation 10: Distributed Algorithms

2017-01-0350:18

Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

2017-01-0301:12:03

Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking

Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking

2017-01-0301:17:33

Recitation 9: Approximation Algorithms: Traveling Salesman Problem

Recitation 9: Approximation Algorithms: Traveling Salesman Problem

2017-01-0331:59

Lecture 18: Complexity: Fixed-Parameter Algorithms

Lecture 18: Complexity: Fixed-Parameter Algorithms

2017-01-0301:17:43

Lecture 17: Complexity: Approximation Algorithms

Lecture 17: Complexity: Approximation Algorithms

2017-01-0301:21:08

Recitation 8: NP-Complete Problems

Recitation 8: NP-Complete Problems

2017-01-0345:46

Lecture 16: Complexity: P, NP, NP-completeness, Reductions

Lecture 16: Complexity: P, NP, NP-completeness, Reductions

2017-01-0301:25:25

Lecture 15: Linear Programming: LP, reductions, Simplex

Lecture 15: Linear Programming: LP, reductions, Simplex

2017-01-0301:22:27

Recitation 7: Network Flow and Matching

Recitation 7: Network Flow and Matching

2017-01-0351:12

Lecture 14: Incremental Improvement: Matching

Lecture 14: Incremental Improvement: Matching

2017-01-0301:22:32

Lecture 13: Incremental Improvement: Max Flow, Min Cut

Lecture 13: Incremental Improvement: Max Flow, Min Cut

2017-01-0301:22:57

Recitation 6: Greedy Algorithms

Recitation 6: Greedy Algorithms

2017-01-0322:24

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

2017-01-0301:22:09

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

2017-01-0301:21:49

00:00

00:00

x

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Erik Demaine