Lectures related to Max Sum Diversification

Covers linear programming duality and complementary slackness condition.

Explores Cheeger's inequalities for random walks on graphs and their implications.

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Minimum Spanning Trees

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Theory of Computation: Monotone Complexity and XOR-SAT Lower Bounds

Explores monotone complexity, XOR-SAT lower bounds, and their implications in computational theory.

Graph Algorithms: Ford-Fulkerson and Strongly Connected Components

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Graph Theory Basics

Introduces induced flows, basis matrices, and tree solutions in graph theory.

Relations Between Events

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.