Dynamic Programming: Knapsack

Related lectures (52)

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Covers the concept of algorithms, loop invariants, and examples of algorithmic problem-solving.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Introduces graph theory basics, Ramsey theory, and graph coloring concepts.

Explores convex polyhedra, linear programs, and their optimization importance.

Covers semi-definite programming and optimization over positive semidefinite cones.

Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.

Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

Demonstrates dynamic programming to find the number of ways to make change using different coin denominations.

Covers the process of solving Linear Programs (LPs) using the simplex method.

Discusses variance reduction techniques in stochastic simulation, focusing on allocation strategies and replica generation algorithms.

Page 3 of 3