Introduction to Shortest PathIntroduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Networks: TreesExplains the concept of trees in graph theory and the definition of a spanning tree.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Assembly: Mechanism TheoryCovers the problem statement of assembly, precision requirements, common couplings, stability, and spatial vectors.
Knowledge Inference for GraphsExplores knowledge inference for graphs, discussing label propagation, optimization objectives, and probabilistic behavior.
