Greedy Algorithms & Matroids

Related lectures (19)

Page 1 of 2

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Covers classical and quantum computational complexity concepts and implications.

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.