YoVDO

Dynamic Algorithms for Center on Graphs

Offered By: Simons Institute via YouTube

Tags

Dynamic Graphs Courses Algorithm Design Courses Approximation Algorithms Courses

Course Description

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

Related Courses

Approximation Algorithms Part I
École normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Delivery Problem
University of California, San Diego via Coursera