Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximations for sums of distances, clustering and the Fermat-Weber problem |
scientific article; zbMATH DE number 1902836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximations for sums of distances, clustering and the Fermat-Weber problem |
scientific article; zbMATH DE number 1902836 |
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
0.7829523086547852
0 references
0.7724384069442749
0 references
0.7667053937911987
0 references
0.7620689868927002
0 references
