Lectures related to Transhipment and Shortest Paths

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

Dijkstra's Algorithm and Probabilistic Analysis

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

Dynamic Programming: Shortest Paths Algorithms

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Search Algorithms: Two Examples

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

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.

Minimum Spanning Trees: Prim's Algorithm

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

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Designing Algorithms: Recursion and Dynamic Programming

Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.

Shortest Path: Properties of the Algorithm

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

Calcul and Algorithms: What is an Algorithm?

Covers the basics of algorithms in computer science, including their formalization and complexity.

Dynamic Programming: Bellman-Ford and Dijkstra

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

Shortest Path in Directed Graphs

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

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Dijkstra's Algorithm and Shortest Path

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

Theory of Computation: NP Problems Examples

Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.

Introduction to Shortest Path

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

Computation & Algorithms II: Binary Search and Merge Sort

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.