CS-627 / 2 credits

Teacher: Svensson Ola Nils Anders

Language: English


Frequency

Only this year

Summary

This course covers numerous powerful algorithmic techniques (greedy, local search, linear programming, multiplicative weight update, ...). The concepts are studied in clean and simple settings so as to emphasize the main algorithmic ideas over problem specific details.

Content

Keywords

Algorithms, set cover

Learning Prerequisites

Required courses

Undergraduate algorithms and basic discrete math/probabilities

Assessment methods

Project report

Resources

Notes/Handbook

Learning Outcomes: To apply a rich algorithmic toolbox in order to solve their favorite problems.

Websites

In the programs

  • Exam form: Project report (session free)
  • Subject examined: Algorithmic Toolbox
  • Lecture: 20 Hour(s)

Reference week

Related courses

Results from graphsearch.epfl.ch.