Approximation Algorithms Courses and Certifications

Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems - Lecture II

Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.

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

Simons Institute

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.

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

Delivery Problem

376 ratings at Coursera

Implement efficient Python programs for the traveling salesman problem, exploring exact and approximation algorithms while applying discrete mathematics concepts.

• Coursera
• 13 hours 23 minutes
• Self-Paced
• Paid Course

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

2 ratings

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• Self-Paced
• Free Video

Design and Analysis of Algorithms

2 ratings

Comprehensive exploration of advanced algorithm design and analysis, covering diverse topics from interval scheduling to cryptography and distributed systems.

• MIT OpenCourseWare
• 39 hours
• Self-Paced
• Free Video

NPTEL;  IIT Bombay

Design and Analysis of Algorithms

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• Self-Paced
• Free Video

USC Probability and Statistics Seminar

Are Neural Networks Optimal Approximation Algorithms for Constraint Satisfaction Problems?

Explore neural networks' capability to solve NP-hard optimization problems, focusing on constraint satisfaction and their potential as optimal approximation algorithms.

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

Isaac Newton Institute for Mathematical Sciences

Optimality of Algorithms for Approximation and Computation - Rothschild Lecture

Explore optimality in approximation and computation algorithms with Prof. Ronald DeVore's in-depth analysis of mathematical techniques and their applications in data science.

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

Open Data Science

Testing Positive Semidefiniteness and Eigenvalue Approximation - Optimal Algorithms and Novel Approaches

Explore optimal algorithms for testing positive semidefiniteness and eigenvalue approximation, featuring a novel random walk method and innovative techniques for matrix analysis and algorithm optimization.

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

IEEE

Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

Explore efficient algorithms for positive semidefinite low-rank approximation, focusing on robustness and sample optimality in matrix computations.

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

Institute for Pure & Applied Mathematics (IPAM)

Quantum Approximation Algorithms - IPAM at UCLA

Explore quantum approximation algorithms, their potential advantages over classical counterparts, and recent developments in optimizing quantum systems and solving discrete optimization problems.

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

Simons Institute

Tolerant Property Testing and Distance Approximation in Sublinear Algorithms

Explore tolerant property testing and distance approximation algorithms for various object types and properties. Gain insights into bipartiteness, monotonicity, uniformity, and subsequence-freeness.

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

Squid: Schools for Quantum Information Development

Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians

Delve into advanced algorithms for approximating ground state energy and free energy in quantum local Hamiltonians, exploring new techniques for dense systems and sparse graphs with fixed minor exclusions.

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

IIT Kharagpur;  NPTEL

Approximation Algorithm

Explore efficient algorithms for NP-complete problems, covering vertex cover, set cover, knapsack, linear programming, rounding techniques, primal-dual method, and semidefinite programming.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course

Second Level Algorithms

Delve into advanced algorithm topics including amortized analysis, network flow, computational geometry, NP-completeness, and randomized algorithms, building on foundational knowledge to tackle complex computational problems.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course