Minimum Spanning TreesCovers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Introduction to Shortest PathIntroduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Minimal Spanning TreeCovers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
