Skip to main content
Side panel
More
English (en)
Català (ca)
Deutsch (de)
Deutsch (du) (de_du)
English (en)
Español - Internacional (es)
Français (fr)
Italiano (it)
Português - Portugal (pt)
Svenska (sv)
Türkçe (tr)
Русский (ru)
العربية (ar)
You are currently using guest access
Log in
Open course index
Home
WS20_AdvAlg
Literatur und zusätzliche Materialien
[RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments
[RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments
Click on
[RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments
to open the resource.
◄ [BS '05] On the computational complexity of the rooted subtree prune and regraft distance
Jump to...
Jump to...
LaTeX Template for exercise submissions
1. Übungsblatt (Abgabe bis 9.11.2020)
2.Übungsblatt (Abgabe bis 16.11.2020)
3.Übungsblatt (Abgabe bis 23.11.2020)
4.Übungsblatt (Abgabe bis 30.11.2020)
5.Übungsblatt (Abgabe bis 7.12.2020)
6.Übungsblatt (Abgabe bis 14.12.2020)
7.Übungsblatt (Abgabe bis 21.12.2020)
8.Übungsblatt (Abgabe bis 11.01.2021)
9.Übungsblatt (Abgabe bis 18.01.2021)
10.Übungsblatt (Abgabe bis 25.01.2021)
11.Übungsblatt (Abgabe bis 1.02.2021)
[Goldberg, Tarjan '88] A new approach to the maximum-flow problem
[Mann '17] The Top Eight Misconceptions about NP-Hardness
[GW '95] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
[BS '05] On the computational complexity of the rooted subtree prune and regraft distance
[Jacobson '89] Space-efficient static trees and graphs
[Jacobson '89] Space-efficient static trees and graphs ►