vix.ing · top · new · best · stats

Fast approximations for sums of distances, clustering and the Fermat–Weber problem

2002/12/02 by Prosenjit Bose, Anil Maheshwari, Pat Morin · 59 citations
Business, Management and Accounting · Computer Science · Mathematics · #Algorithm #Approximation algorithm #Artificial intelligence #Cluster analysis #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constant (computer programming) #Data Management and Algorithms #Dimension (graph theory) #Discrete mathematics #Euclidean geometry #Facility Location and Emergency Management #Fermat's Last Theorem #Geometry #Mathematics #Point (geometry) #Preprocessor #Randomized algorithm #Set (abstract data type) #Statistics

paper · pdf · doi:10.1016/s0925-7721(02)00102-5

published in Computational Geometry 24(3), 135-146 (Elsevier BV)

openalex publication_date 2002/12/02 · crossref created 2002/12/02 · crossref issued 2003/04/01 · crossref published 2003/04/01 · crossref published-print 2003/04/01 · crossref deposited 2019/04/02 · openalex created_date 2025/10/10 · crossref indexed 2026/05/13 · openalex updated_date 2026/08/03

Citations

Cited by