20 citations · 71 across the 26 of their papers we have counts for
4 papers · 1 filter
A Tree Structure For Dynamic Facility Location
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of client…
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
Gramoz Goranci
Graphs naturally appear in several real-world contexts including social networks, the web network, and telecommunication networks. While the analysis and the understanding of graph…
Fully Dynamic k-Center Clustering in Doubling Metrics
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski +2
Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is st…
Fully Dynamic Spectral Vertex Sparsifiers and Applications
David Durfee, Yu Gao, Gramoz Goranci +1
We study \emph{dynamic} algorithms for maintaining spectral vertex sparsifiers of graphs with respect to a set of terminals of our choice. Such objects preserve pairwise resist…