2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2026
Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
Given a weighted undirected graph, a number of clusters , and an exponent , the goal in the -clustering problem on graphs is to select vertices as centers that mi…
cs.DS2024★ 2 cited
Dynamic Consistent -Center Clustering with Optimal Recourse
Sebastian Forster, Antonis Skarlatos
Given points from an arbitrary metric space and a sequence of point updates sent by an adversary, what is the minimum recourse per update (i.e., the minimum number of changes neede…