Lectures related to Prim's and Kruskal's Algorithms

Explores graph algorithms like BFS and DFS, discussing shortest paths, spanning trees, and data structures' role.

Explores rounding the relaxation and Max Sum Diversification, discussing effects, integral solutions, and loss bounds.

Explores the Closest Vector Problem and Voronoi cells in lattice reduction algorithms.

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.