Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5290249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the constrained \(k\)-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i>-Median clustering in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for Clustering Constrained Data without Locality Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coresets for k-means and k-median clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time approximation schemes for clustering problems in any dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimum enclosing balls in high dimensions using core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering through continuous facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for a problem of search for a vector subset / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of a minimal ball enclosing k points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation of the smallest \(k\)-enclosing ball problem / rank
 
Normal rank

Latest revision as of 16:00, 24 July 2024

scientific article; zbMATH DE number 7315675
Language Label Description Also known as
English
Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
scientific article; zbMATH DE number 7315675

    Statements

    Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (English)
    0 references
    0 references
    25 February 2021
    0 references
    geometric clustering
    0 references
    continuous facility location
    0 references
    approximate centers
    0 references
    Euclidean space
    0 references
    high dimensions
    0 references

    Identifiers