You can take this course if you have completed at least one of the courses Advanced Algorithms (2IL45), Geometric Algorithms (2IL55), Algorithms for massive data (2IL75) or Algorithms for geographic data (2IL76) successfully. However, if your study plan allows it, it is better to complete at least two of these courses before taking ​2IL95.

+

You can take this course if you have completed at least one of the courses Advanced Algorithms (2IL45), Geometric Algorithms (2IL55), Algorithms for massive data (2IL75) or Algorithms for geographic data (2IL76) successfully. However, if your study plan allows it, it is better to complete at least two of these courses before taking ​2IMA00.

If you have not completed any of the aforementioned courses, but you have completed other Master'​s courses that are highly relevant to the topic of the seminar, then please contact the [[#​instructors]] to discuss if you can be admitted to the course.

If you have not completed any of the aforementioned courses, but you have completed other Master'​s courses that are highly relevant to the topic of the seminar, then please contact the [[#​instructors]] to discuss if you can be admitted to the course.

Line 39:

Line 39:

The kick-off meeting and introductory lecture of the course is on Tuesday 19th April 15:45 - 17:30 in Metaforum 15.

The kick-off meeting and introductory lecture of the course is on Tuesday 19th April 15:45 - 17:30 in Metaforum 15.

-

After that we will, in principle, meet two times per week. Attendance at all meetings is required. In particular, any student who is absent at the kick-off meeting without prior notice, is assumed not to be taking the course.

+

After that we will, in principle, meet two times per week. **Attendance at all meetings is required.** In particular, any student who is absent at the kick-off meeting without prior notice, is assumed not to be taking the course. Afterwards we we will meet two times per week, with some exceptions.

-

The detailed schedule for the course will be posted here once the course starts.

+

* Tuesday hours 7+8 (15:​45-17:​30),​ MF 15

+

* Thursday hours 3+4 (10:​45-12:​30),​ MF 13

+

Please note that the detailed schedule below is tentative and may be adapted during the course.

Instead of requiring an algorithm to find maximum matchings, it just needs an approximation algorithm for (weighted) feedback vertex set. It was developed independently by 2 sets of authors. Pick the one you find the easiest to read:

I don't know which of the 2 approaches will be faster on the inputs we have; one has a worse polynomial term, the other has a worse factor f(k). I don't think it is feasible to implement both, given the time. Pick one of the two and go for it. To **find** a tree decomposition,​ you can use one of the heuristics described in this paper:

For the iterative compression algorithm, I think the book gives sufficient details to build an implementation from. There is a theoretically faster algorithm, which is linked below. You could read it for inspiration,​ but it's not necessary and I do not think it is feasible to implement it fully because it needs a subroutine with matroid computations.