Dynamic Algorithms for Center on Graphs

Explore dynamic algorithms for k-center problems on graphs in this 51-minute lecture by Sebastian Forster from the University of Salzburg. Delve into the first efficient approximation algorithms for solving k-center problems on dynamic graphs undergoing edge updates. Gain insights into the collaborative research conducted with Emilio Cruciani, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos. Learn about the intersection of dynamic graphs and algorithm design, focusing on innovative approaches to tackle this challenging computational problem.

Dynamic Algorithms for -center on Graphs