Description
Approximation Algorithms Part II is the second part of Approximation Algorithms course by online university Coursera It has been published. This is continued Approximate algorithms part 1 Is. Here you will learn the duality of linear programming applied in designing some approximate algorithms and semi-definite programming applied in Maxcut.
By completing the two parts of this course, you will be exposed to a wide range of problems in the fundamentals of theoretical computer science and powerful design and analysis techniques. Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of the few well-known fundamental problems, and you will be able to find linear programming relaxations. and use random rounding to attempt your solution. The problem with the course content and especially the course assignments is theoretical in nature without programming assignments.
This is the second of a two-part course on approximate algorithms.
What you will learn in the Approximation Algorithms Part II training course:
- Duality of linear programming
- Steiner forest and primal-dual approximation algorithms
- Facility location and primal-dual approximation algorithms
- Maximum cutting and semi-definite programming
Course details
- Publisher: Coursera
- English language
- Duration: 33 hours
- Number of training weeks: 4
- teacher: Claire Mathieu
- File format: mp4
- Course Level: Introductory to Advanced
- Providing institution/university: École normale supérieure
Course headings
Week 1
Linear Programming Duality
Week 2
Steiner Forest and Primal-Dual Approximation Algorithms
Week 3
Facility Location and Primal-Dual Approximation Algorithms
Week 4
Maximum Cut and Semi-Definite Programming
Approximation Algorithms Part II course images
Course introduction video
Installation guide
After Extract, view with your favorite Player.
English subtitle
Quality: 720p
download link
Password file(s): www.downloadly.ir
Size
1.47 GB
Be the first to comment