Lectures in course CS-450: Algorithms II

Covers submodular functions and their minimization, emphasizing diminishing returns and the Lovász Extension.

Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.

Submodular Maximization

Covers submodular function maximization using the greedy algorithm and its approximation guarantee.

Online Algorithms: Competitive Ratio

Covers online algorithms and competitive ratio in caching strategies to optimize memory usage.

Spectral Graph Theory: Introduction

Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.

Cheeger's Inequalities

Covers Cheeger's inequalities and the combinatorial properties of graphs.