FDD3402 Combinatorial Optimization 6.0 credits

Kombinatorisk optimering

Offering and execution

Course offering missing for current semester as well as for previous and coming semesters

Course information

Content and learning outcomes

Course contents *

The course aims to give a foundation of advanced techniques that lead to efficient exact algorithms. After an introduction to fundamental polyhedral concepts such as integral polyhedra and their connection to totally unimodular matrices, the course focuses on matroids and their connection to greedy algorithms.

The last part of the course introduces expander graphs from a combinatorial optimization point of view.

Intended learning outcomes *

After the course, the students should

  • know basic concepts from polyhedral combinatorics
  • be able to recognize several types efficiently solvable problems based on polyhedral techniques and matroids
  • be able to understand techniques from combinatorial optimization used in research papers
  • have an enhanced base of techniques to approach open algorithmic problems.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

No information inserted

Recommended prerequisites

The course is selfcontained, but it is beneficial to have basic knowledge of optimization problems and in particular linear programming as it was provided, for instance, in the course DD3390, Approximation Algorithms given by Ola Svensson in 2010.

Equipment

No information inserted

Literature

No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale *

P, F

Examination *

    Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

    The examiner may apply another examination format when re-examining individual students.

    Opportunity to complete the requirements via supplementary examination

    No information inserted

    Opportunity to raise an approved grade via renewed examination

    No information inserted

    Examiner

    Per Austrin

    Ethical approach *

    • All members of a group are responsible for the group's work.
    • In any assessment, every student shall honestly disclose any help received and sources used.
    • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

    Further information

    Course web

    No information inserted

    Offered by

    EECS/Theoretical Computer Science

    Main field of study *

    No information inserted

    Education cycle *

    Third cycle

    Add-on studies

    No information inserted

    Contact

    Tobias Mömke, e-post: moemke@kth.se

    Supplementary information

    The course is mainly targeted to graduate students at KTH in computer science and mathematics, but also open for advanced undergraduate students.

    Postgraduate course

    Postgraduate courses at EECS/Theoretical Computer Science