Shortest path: Properties | EPFL Graph Search

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Explains the properties of the shortest path algorithm and how to find the shortest path in a network.

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

Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.

Covers the transhipment and shortest path problems in network optimization.