An FPTAS for a vector subset search problem (Q5264739)

From MaRDI portal
Revision as of 15:09, 21 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6466097
Language Label Description Also known as
English
An FPTAS for a vector subset search problem
scientific article; zbMATH DE number 6466097

    Statements

    An FPTAS for a vector subset search problem (English)
    0 references
    0 references
    0 references
    27 July 2015
    0 references
    finding a vector subset
    0 references
    Euclidean space
    0 references
    minimum of the sum of squared distances
    0 references
    NP-hardness
    0 references
    fully polynomial time
    0 references
    approximation scheme
    0 references

    Identifiers