Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Robust Methods for Data Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Statistical Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5270493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a vector subset search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of some quadratic Euclidean 2-clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some quadratic Euclidean 2-clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center / 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: Solving some vector subset problems by Voronoi diagrams / 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: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two-cluster partition of a set of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154035 / rank
 
Normal rank

Revision as of 20:20, 20 July 2024

scientific article
Language Label Description Also known as
English
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
scientific article

    Statements

    Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2019
    0 references
    partitioning
    0 references
    Euclidean space
    0 references
    minimum sum-of-squared distances
    0 references
    NP-hardness
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references