Fast approximations for sums of distances, clustering and the Fermat-Weber problem
type: Item
instance of: scholarly article
title: Fast approximations for sums of distances, clustering and the Fermat-Weber problem
zbMATH Open document ID: 1016.65040
DOI: 10.1016/S0925-7721(02)00102-5
author: Prosenjit Bose
author: Anil Maheshwari
author: Pat Morin
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1902836
zbMATH Keywords: Fermat-Weber center
zbMATH Keywords: range tree
zbMATH Keywords: quadtree
zbMATH Keywords: clustering
zbMATH Keywords: facility location
zbMATH Keywords: data structure
zbMATH Keywords: randomization
zbMATH Keywords: geometric optimization
zbMATH Keywords: algorithm
Wikidata QID: Q62065763
describes a project that uses: clusfind
MaRDI profile type: Publication
cites work: The algebraic degree of geometric optimization problems
cites work: Q3024790
cites work: The rectilinear distance minisum problem with minimum distance constraints:
cites work: Algebraic optimization: The Fermat-Weber location problem
cites work: Efficient Algorithms for the Capacitated 1-Median Problem
cites work: Robust distance-based clustering with applications to spatial data mining
cites work: Sublinear time algorithms for metric space problems
cites work: Improved algorithms for placing undesirable facilities
cites work: Finding Groups in Data
cites work: Two Notes on Notation
cites work: Q5669010
cites work: The complexity of facets (and some facets of complexity)
cites work: Q3992847
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
description: scientific article; zbMATH DE number 1902836