Approximation Algorithms Courses and Certifications

UofU Data Science

Advanced Algorithms (Fall 2019)

Master sophisticated algorithmic techniques and computational problem-solving strategies through comprehensive university-level lectures covering advanced topics in algorithm design and analysis.

• YouTube
• 1 day 10 hours 46 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Simons Institute

A Slightly Improved Approximation Algorithm for Metric TSP

Explore an improved approximation algorithm for the Metric Traveling Salesman Problem, focusing on 2-uniform spanning trees and probabilistic techniques in algorithm design.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Simons Institute

Crash Course on Probabilistically Checkable Proofs - Introduction

Explore probabilistically checkable proofs, including recoloring, constraint satisfaction, and the PCP theorem. Learn about verifier parameters and hardness of approximation in this comprehensive introduction.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

Simons Institute

A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making

Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video

International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• Free Video

Building an Open Source Streaming Analytics Stack with Kafka and Druid

Learn to build a robust streaming analytics stack using Kafka and Druid for real-time data processing, flexible querying, and maintaining data integrity in high-volume environments.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Google TechTalks

One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies

Explore polylogarithmic universal Steiner trees and strong sparse partition hierarchies. Learn about new constructions improving approximation guarantees and matching logarithmic lower bounds.

• YouTube
• 57 minutes
• Self-Paced
• Free Video

Institute for Advanced Study

Computer Science and Game Theory - A Conversation

Explore the intersection of computer science and game theory, from Internet routing to blockchain pricing, and discover how computational tools provide new insights into Nash equilibria and auction design.

• YouTube
• 1 hour 14 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Summer School on Modern Directions in Discrete Optimization

Explore cutting-edge techniques in discrete optimization including parameterized algorithms, tropical geometry applications, interior point methods, and approximation algorithms.

• YouTube
• 15 hours 13 minutes
• Self-Paced
• Free Video

UofU Data Science

Advanced Algorithms - Fall 2015

Master sophisticated algorithmic techniques and computational complexity through comprehensive university-level lectures covering advanced data structures and optimization methods.

• YouTube
• 1 day 3 hours 59 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

Explore constraint satisfaction problems in boolean functions, covering topics like Max3SAT, Max3Coloring, and approximation algorithms for complex computational challenges.

• YouTube
• 1 hour 15 minutes
• Self-Paced
• Free Video

Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.

• YouTube
• 40 minutes
• Self-Paced
• Free Video

Association for Computing Machinery (ACM)

Constant Girth Approximation for Directed Graphs in Subquadratic Time

Explore subquadratic-time algorithms for approximating constant girth in directed graphs, covering ball growing techniques, random sampling, and combined approaches for efficient graph analysis.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Paul G. Allen School

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Explore parallel algorithms for approximating undirected shortest paths using low hop emulators. Learn about innovative techniques and their applications in graph theory.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Free Video