Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Dynamic Algorithms for Center on Graphs

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Dynamic Algorithms for -center on Graphs

Taught by

Simons Institute

Reviews

Start your review of Dynamic Algorithms for Center on Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.