Algorithm Engineering for NP-hard Graph Problems: Preprocessing, Bounds and Greedy Algorithms
Time
Wednesday, 3. February 2021
16:00 - 16:45
Location
online
Organizer
Speaker:
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.