Description
Course on Approximation Algorithms, Part I, published by Coursera Online University. How efficiently can you pack items in a minimum number of boxes? How can you group nodes together in a way that splits the network into pieces around multiple hubs at a lower cost? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so we aim to provide an approximate solution that can be computed in polynomial time while having provable guarantees that its cost is relative to optimality.
This course takes the knowledge of a standard undergraduate algorithm course and places special emphasis on algorithms that can be designed using linear programming, a popular and surprisingly successful technique in the field. By taking this course, you will be exposed to a wide range of problems related to theoretical fundamentals of computer science and powerful design and analysis techniques. Once completed, 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 relaxations in linear programming. and use random rounding to try to solve yours. The problem with the course content and especially the course assignments is theoretical in nature and without programming assignments.
This is the first of a two-part course on approximate algorithms.
What you will learn in Part I of Approximation Algorithms:
- Vertex coverage and linear programming
- Gathering and backpacking
- Bin packing, linear programming and rounding
- Adjust coverage and random rounding
- Multi-directional cropping and random rounding
Course Specifications
- Editor: Coursera
- Instructors: Claire Mathieu
- French language
- Level: Introductory to Advanced
- establishment/university: École Normale Supérieure
- Number of weeks: 5
- Duration: approx. 36 hours to complete
Courses included:
Week 1
Vertex coverage and linear programming
Week 2
Backpack and rounded
Week 3
Bin packing, linear programming and rounding
Week 4
Set coverage and random rounding
Week 5
Multi-directional cutting and random rounding
Pictures
Introduction to Approximation Algorithms Part I Video
Installation guide
After the clip, watch with your favorite reader.
Subtitle: English
Quality: 720p
Download link
File password(s): free download software
size
1.60 GB