Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872)

From MaRDI portal
Revision as of 05:38, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6784112
Language Label Description Also known as
English
Tight bounds for single-pass streaming complexity of the set cover problem
scientific article; zbMATH DE number 6784112

    Statements

    Tight bounds for single-pass streaming complexity of the set cover problem (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    streaming algorithms
    0 references
    communication complexity
    0 references
    covering integer programs
    0 references
    set cover
    0 references

    Identifiers