10 citations · 12 across the 2 of their papers we have counts for
4 papers
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…
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…
Dynamic clustering to minimize the sum of radii
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii,…
A Tight Bound for Shortest Augmenting Paths on Trees
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski +1
The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it…