Abstract
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.
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.