Výsledky vyhledávání - k-Center clustering Distributed graph algorithms Shortest path metric

(k\)-Center Clustering in Distributed Models Autor Biabani, Leyla, Paz, Ami

“… We initiate the study of the \(k\)-center problem in a setting where the underlying metric is the graph's shortest path metric in three canonical distributed settings…”
Získat plný text