1. Polynomial time approximation schemes for clustering in low highway dimension graphs;Feldmann,2020
2. Greedy strikes back: improved facility location algorithms;Guha;J. Algorithms,1999
3. A new greedy approach for facility location problems;Jain,2002
4. The hardness of approximation of Euclidean k-means;Awasthi,2015
5. Approximation schemes for Euclidean k-medians and related problems;Arora,1998