A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (Q3186828)

From MaRDI portal
Revision as of 21:11, 1 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
scientific article

    Statements

    A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (English)
    0 references
    0 references
    0 references
    12 August 2016
    0 references
    search for vector subset
    0 references
    randomized algorithm
    0 references
    asymptotical exactness
    0 references

    Identifiers