Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: clusfind / rank | |||
Normal rank | |||
Revision as of 11:05, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximations for sums of distances, clustering and the Fermat-Weber problem |
scientific article |
Statements
Fast approximations for sums of distances, clustering and the Fermat-Weber problem (English)
0 references
28 April 2003
0 references
Fermat-Weber center
0 references
range tree
0 references
quadtree
0 references
clustering
0 references
facility location
0 references
data structure
0 references
randomization
0 references
geometric optimization
0 references
algorithm
0 references
