Lectures related to Iterative Rounding Heuristic

Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.

Explains injective, surjective, and bijective functions using examples and graphs.

Covers the concept of renormalization in Algebraic Quantum Field Theory.

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Covers the optimization of pseudometrics in graphs, focusing on minimizing pseudometrics and the shortest path metric.

Covers functions of real numbers, graphing, and affine functions.

Explains injectivity and surjectivity criteria in functions using graphical representations.

Covers the concept of reciprocal functions and their properties, with various illustrative examples.

Explores the connection between graphs and probabilities, emphasizing modular and super modular probabilities and correlation properties.