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

From MaRDI portal
Created claim: Wikidata QID (P12): Q62065763, #quickstatements; #temporary_batch_1703752091637
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: clusfind / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear distance minisum problem with minimum distance constraints: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic optimization: The Fermat-Weber location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Capacitated 1-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust distance-based clustering with applications to spatial data mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time algorithms for metric space problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for placing undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Notes on Notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5669010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:35, 5 June 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
    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
    0 references