Algorithm Engineering for NP-hard Graph Problems: Preprocessing, Bounds and Greedy Algorithms
Wann
Mittwoch, 3. Februar 2021
16 bis 16:45 Uhr
Wo
online
Veranstaltet von
Vortragende Person/Vortragende Personen:
Moritz Beck
Advisors: Prof. Dr. Sabine Storandt, Priv.-Doz. Dr. habil. Joachim Spoerhase (Uni Würzburg)
Chair: Prof. Dr. Michael Grossniklaus
The proposal talks will be hosted on BigBlueButton, for the room link please check your mails.