Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q62065763, #quickstatements; #temporary_batch_1703752091637 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62065763 / rank | |||
Normal rank | |||
Revision as of 10:34, 28 December 2023
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
