Dynamic Programming: Bellman-Ford and Dijkstra

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 2 of 3

Simplex Algorithm: Basics

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

Set Cover: Integrality Gap

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Suspension Optimisation: Performance Analysis and Optimization

Explores the design and optimization of car suspensions for improved performance.

PCA: Derivation and Optimization

Covers the derivation of PCA projection, error minimization, and eigenvector optimization.

Quantum Approximate Optimization Algorithm

Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.

Shortest Path: Properties of the Algorithm

Explains the properties of the shortest path algorithm and how to find the shortest path in a network.

Building Robust Ensembles via Margin Boosting

Delves into building robust ensembles through margin boosting for improved adversarial defense in machine learning models.

Complex Systems: Critical Phenomena

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

Approximation Algorithms

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

Monte Carlo Chain: Motivation and Algorithm

Explores the motivation and algorithm behind the Monte Carlo Chain method.