Dynamic Programming: Bellman-Ford and Dijkstra

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (49)

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Solving Parity Games in Practice

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

Search Algorithms: Abductive Reasoning

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Coin Change Problem

Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Dynamic Programming: Pascal's Triangle & Floyd's Algorithm

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

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.

Shortest Path: Properties of the Algorithm MOOC: Optimization: principles and algorithms - Network and discrete optimization

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

Approximation Algorithms

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

Optimization Methods MOOC: Optimization: principles and algorithms - Network and discrete optimization MOOC: Optimization: principles and algorithms - Unconstrained nonlinear optimization MOOC: Optimization: principles and algorithms - Linear optimization

Covers the Newton's local method in Python using NumPy for optimization.

Dijkstra's Algorithm and Probabilistic Analysis Log in to Mediaspace to watch this video

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Shortest Path in Directed Graphs Log in to Mediaspace to watch this video

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.

Dijkstra's Algorithm and Shortest Path Log in to Mediaspace to watch this video

Covers Dijkstra's algorithm for shortest path problems and its application in ALL-TO-ONE and ALL-PAIRS algorithms.

Simplex Algorithm: Basics Log in to Mediaspace to watch this video

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

Quantum Approximate Optimization Algorithm Log in to Mediaspace to watch this video

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

Monte Carlo Chain: Motivation and Algorithm Log in to Mediaspace to watch this video

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

Minimum Spanning Trees Log in to Mediaspace to watch this video

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Introduction to Shortest Path Log in to Mediaspace to watch this video

Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.

Page 1 of 3