Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747)

From MaRDI portal
Revision as of 15:24, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references