filmov
tv
Dynamic Algorithms for 𝑘-center on Graphs
![preview_player](https://i.ytimg.com/vi/aOjkVGFnlaU/maxresdefault.jpg)
Показать описание
Sebastian Forster (University of Salzburg)
Dynamic Graphs and Algorithm Design
We present the first efficient approximation algorithms for the 𝑘-center problem on dynamic graphs undergoing edge updates. Joint work with Emilio Cruciani, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos.
Dynamic Graphs and Algorithm Design
We present the first efficient approximation algorithms for the 𝑘-center problem on dynamic graphs undergoing edge updates. Joint work with Emilio Cruciani, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos.