Publications with Anastasios Sidiropoulos
Approximate greedy clustering and distance selection for graph metrics.
D. Eppstein,
S. Har-Peled, and
A. Sidiropoulos.
arXiv:1507.01555.
J. Computational Geometry 11 (1): 629–652, 2020.
We provide fast approximation algorithms for the farthest-first traversal of graph metrics.