Approximating min sum set cover (Q1884768)

From MaRDI portal
Revision as of 20:52, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q106094567, #quickstatements; #temporary_batch_1712260040974)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating min sum set cover
scientific article

    Statements

    title
    Approximating min sum set cover (English)
    0 references
    author
    Uriel Feige
    0 references
    László Lovász
    0 references
    Prasad Tetali
    0 references
    published in
    Algorithmica
    0 references
    publication date
    5 November 2004
    0 references
    zbMATH Keywords
    greedy algorithm
    0 references
    randomized rounding
    0 references
    NP-hardness
    0 references
    threshhold
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05C70
    0 references
    05D10
    0 references
    68W40
    0 references
    90C35
    0 references
    zbMATH DE Number
    2113910
    0 references
    OpenAlex ID
    W2134331592
    0 references
    Wikidata QID
    Q106094567
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1884768&oldid=33240367"
    Powered by MediaWiki