Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040)

From MaRDI portal
Revision as of 20:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Combination Can Be Hard: Approximability of the Unique Coverage Problem
scientific article

    Statements

    title
    Combination Can Be Hard: Approximability of the Unique Coverage Problem (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Uriel Feige
    0 references
    publication date
    20 August 2009
    0 references
    zbMATH Keywords
    unique coverage
    0 references
    hardness of approximation
    0 references
    wireless networks
    0 references

    Identifiers

    DOI
    10.1137/060656048
    0 references
    zbMATH DE Number
    5597437
    0 references
    OpenAlex ID
    W2010916800
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3395040&oldid=31586541"
    Powered by MediaWiki