Approximation Algorithms Part I

Description

Approximation algorithms, Part I

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 problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum.

This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. By taking this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to 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 a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem. The course content and in particular the homework is of a theoretical nature without any programming assignments.

This is the first of a two-part course on Approximation Algorithms.

Read more.

Career Relevance by Data Role

The techniques and tools covered in Approximation Algorithms Part I are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts
Techniques
AlgorithmsCluster AnalysisData AnalysisOptimizationProbabilityProgramming

Similar Opportunities
Digital Signal Processing 1: Basic Concepts and Algorithms

Coursera - École Polytechnique Fédérale de Lausanne

Advanced Algorithms and Complexity

Coursera - National Research University Higher School of Economics

Algorithmic Thinking (Part 1)

Coursera - Rice University

Algorithmic Design and Techniques

edX - University of California, San Diego

Algorithmic Toolbox

Coursera - National Research University Higher School of Economics

Programming Fundamentals

Coursera - Duke University

Data Structures

Coursera - National Research University Higher School of Economics

Computational Thinking for Problem Solving

Coursera - University of Pennsylvania