Minimum Spanning TreesCovers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Assembly: Mechanism TheoryCovers the problem statement of assembly, precision requirements, common couplings, stability, and spatial vectors.
Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Relations Between EventsExplores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
