Shortest path, Longest path

Related lectures (29)

Page 2 of 3

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Covers the transhipment and shortest path problems in network optimization.

Covers the optimization of pseudometrics in graphs, focusing on minimizing pseudometrics and the shortest path metric.

Covers optimality conditions, total unimodularity, and algorithms for transhipment problems.

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.