approximation algorithms
-
Coursera Approximation Algorithms Part I
Overview How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such...- Coursera
- Resource
- algorithms approximation algorithms
- Category: Algorithms & Data Structures
-
Coursera Approximation Algorithms Part II
Overview This is the continuation of Approximation algorithms, Part 1. Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. By taking the two parts of this course, you will be exposed to a range of...- Coursera
- Resource
- algorithms approximation algorithms
- Category: Algorithms & Data Structures