A 2-approximation polynomial algorithm for a clustering problem (Q5263825)

From MaRDI portal
Revision as of 20:16, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 6460058
Language Label Description Also known as
English
A 2-approximation polynomial algorithm for a clustering problem
scientific article; zbMATH DE number 6460058

    Statements

    A 2-approximation polynomial algorithm for a clustering problem (English)
    0 references
    0 references
    0 references
    17 July 2015
    0 references
    cluster analysis
    0 references
    search for a vector subset
    0 references
    computational complexity
    0 references
    approximation polynomial
    0 references
    approximation algorithm
    0 references

    Identifiers