ViewTube

Davidson CSC 321: Analysis of Algorithms, F22. Week 14 - Monday.

Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. Algorithm Design by J. Kleinberg and E.

This video explores the Traveling Salesman Problem, and explains two approximation algorithms for finding a solution in ...

In this video, we discuss the vertex cover problem. In particular we show that Vertex Cover can be 2-approximated.

We introduce the topic of approximation algorithms by going over the K-Center Problem.

The Multiway Cut Problem generalized the Min-s-t-Cut Problem to more than two terminals. In this video I present a ...

... while not having to spend as much time so one of the key aspects of an approximation algorithm is it's approximation ratio which ...

Learn about Approximation Algorithms, your secret weapon for tackling NP-hard problems! This video breaks down complex ...

In this video we'll discuss minimax approximation. This is a method of approximating functions by minimisation of the infinity ...

In this video, we study the traveling salesperson problem. We present a simple 2-approximation for the metric Traveling ...

In this video, we discuss the Bin Packing problem. We show that Bin Packing allows for a 1.5-approximation. We also present a ...

Lecture recordings of CS 627 – Advanced Algorithms (Summer 2025) Advanced Algorithms (CS 627) is a specialization module ...

These videos are from the Introduction to Computation course on Complexity Explorer (complexityexplorer.org) taught by Prof.

Link to this course on coursera( Special discount) ...

Approximation Algorithm.

Confused about LRU approximation algorithms? This video breaks down the Clock algorithm, Additional Reference Bits, and ...

This is not the standard vertex cover approximation based on maximal matchings (I have another video on this), but an algorithm ...

In this video, study the knapsack problem. We show that the NP-complete knapsack problem can be approximated arbitrarily well, ...