Introduction to Approximation algorithms-1.1 Introduction
Introduction to Approximation Algorithms
()
Course notes 1.1
The Load Balancing problem-2.1 A greedy algorithm for load balancing
A greedy algorithm for load balancing
()
The Load Balancing problem-2.2 Analysis of the greedy-algorithm
Analysis of the greedy-algorithm
()
The Load Balancing problem-2.3 The ordered scheduling-algorithm
The ordered scheduling algorithm
()
The Load Balancing problem-2.4 Quiz: The load balancing problem
Course notes 1.2
LP Relaxation-3.1 The vertex cover problem
The vertex-cover problem
()
LP Relaxation-3.2 An approximation algorithm for vertex-cover
An approximation algorithm for vertex-cover
()
Course notes 3.1
LP Relaxation-3.3 A brief introduction to linear programming
A brief introduction to linear programming
()
LP Relaxation-3.4 Weighted vertex-cover
Weighted vertex-cover
()
LP Relaxation-3.5 LP relaxation for weighted vertex-cover
LP relaxation for weighted vertex-cover
()
LP Relaxation-3.6 LP relaxation: Analyzing approximation ratio
LP relaxation: Analyzing approximation ratio
()
Course notes 3.2
Polynomial-time approximation schemes-4.1 Polynomial-time approximation schemes
Polynomial-time approximation schemes
()
Polynomial-time approximation schemes-4.2 Knapsack Problem
Knapsack Problem
()
Polynomial-time approximation schemes-4.3 A dynamic programming algorithm for knapsack
A dynamic-programming algorithm for knapsack
()
Course notes 4.1
Polynomial-time approximation schemes-4.4 A PTAS for knapsack
A PTAS for knapsack
()
Polynomial-time approximation schemes-4.5 Analysis of the PTAS for knapsack: approximation ratio
Analysis of the PTAS for knapsack: approximation ratio
()
Polynomial-time approximation schemes-4.6 Analysis of the PTAS for knapsack: running time
Analysis of the PTAS for knapsack: running time
()
Course notes 4.2