Archiv
21 Episoden
Episode 20 - Branch and Bound
26 Minuten
Episode 19 - P und NP
24 Minuten
Episode 18 - Verschlüsselung
39 Minuten
Episode 17 - IDEs in dynamischen Flüssen
40 Minuten
Episode 16 - Maximale Matchings
30 Minuten
Episode 15 - Der Simplex-Algorithmus
34 Minuten
Episode 14 - Scheduling
20 Minuten
Episode 13 - Fairness
29 Minuten
Episode 12 - Online-Algorithmen
24 Minuten
Episode 11 - Wahlen
28 Minuten
Episode 10 - Auktionen
37 Minuten
Episode 9 - Rundreiseproblem
32 Minuten
Episode 8 - Maximale Flüsse
25 Minuten
Episode 7 - Kürzeste Wege II
31 Minuten
Episode 6 - MATSim und EpiSim
44 Minuten
