Algorithms Lab

Applications of LP Duality: Matchings, Flows and Shortest Path

Steiner Forest via Primal-Dual

MaxSat by LP Rounding

LP-based Approximation Algorithms for Set Cover: LP Rounding, Primal-Dual and Dual fitting

Linear Programming (LP) Duality, part 1: Introduction and Physical Interpretation

Linear Programming (LP) Duality, part 2: Farkas Lemma

Simplex Algorithm, part 4: Efficiency/Pivot Rules

Simplex Algorithm, part 2: Exceptions

Simplex Algorithm, part 3: the simplex algorithm in general

Simplex Algorithm, part 1: Introductory Example

Theory of Linear Programming: convex polytopes, equational form and basic feasible solutions

Integer Linear Programming

Hash Tables (part 2): Resolving Collisions

Heaps (part 2): Heap Operations, Build Heap, Heapsort

Approximation Algorithms: Introduction by the Example of Vertex Cover

Polygon Triangulation, Art Gallery Problem

Elementary Data Structures (part 1): Stacks and Dynamic Arrays

5.2 Elementary Data Structures: Resizing Growable Arrays (old version)

Approximation algorithm for vertex cover using local ratio (aka layering)

Algorithm Efficiency

Greedy Approximation Algorithm for Set Cover

Approximation Algorithm for Metric k-Center using Parametric Pruning

Advanced Algorithms - Pre-Knowledge Check

From Set Cover to Shortest Superstring

Traveling Salesperson Problem and the Held-Karp Dynamic Programming Algorithm

Linear-time sorting, part 2: Counting Sort, Radix Sort and Bucket Sort

Fully Polynomial-Time Approximation Scheme for the Knapsack Problem

Amortized Analysis: Aggregate Analysis and Accounting Method

Range Searching

Introduction to flow networks (classroom lecture)

Analyzing recursive algorithms: how to solve recurrences

Quadtrees, Balanced Quadtrees, and Meshing

Convex Hull Algorithms

Plane Sweep Algorithm for finding Line Segment Intersections

Voronoi diagrams (Delaunay triangulations and Voronoi diagrams, part 1)

Delaunay triangulations (Delaunay triangulations and Voronoi diagrams, part 2)

Graphs and Graph Representation (Elementary Graph Algorithms, part 1)

Robot Motion Planning: Introduction, Road Map, and Configuration Spaces (part 1 of 3)

Sorting Algorithms

Heaps (part 1): Priority Queues and Introduction to Max-Heaps

Windowing queries 1/3: Interval Trees

Fibonacci Heaps

Linear-time sorting, part 1: Lower bound

Practical Efficiency of Fibonacci Heaps