Approximation Algorithms Courses and Certifications

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

Sums - Approximation Methods for Recurrences and Algorithms - Lecture 5

Master sum approximation techniques including perturbation, ansatz method, and integral method for recurrences, counting, probability, and algorithm analysis.

• YouTube
• 1 hour 22 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

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

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

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

IIT Kharagpur;  NPTEL

Selected Topics in Algorithms

Advanced algorithm design techniques for efficient problem-solving in computer science. Covers network flows, randomization, approximation algorithms, and parameterized algorithms for various applications.

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

NPTEL;  IIT Kanpur

Computer Algorithms - 2

The course discusses efficient algorithms from a large number of domains. This course assumes the knowledge of data structures, the knowledge big-O notation and the concept of time and space complexity of an algorithm.

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

Strange Loop Conference

Powering Interactive Data Applications at Scale

Explore Druid's architecture for powering interactive analytic applications with millisecond query latencies, comparing it to traditional databases and key/value stores for OLAP use cases.

• YouTube
• 45 minutes
• Self-Paced
• Conference Talk

Hausdorff Center for Mathematics

Combinatorial Optimization - Trimester Program Lectures

Explore advanced combinatorial optimization through expert lectures covering discrete convex analysis, submodular functions, graph theory, and algorithmic approaches.

• YouTube
• 2 days 9 hours 51 minutes
• Self-Paced
• Free Video