On the complexity of approximating \(k\)-set packing (Q2506163)

From MaRDI portal
Revision as of 08:24, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of approximating \(k\)-set packing
scientific article

    Statements

    title
    On the complexity of approximating \(k\)-set packing (English)
    0 references
    author
    Elad Hazan
    0 references
    Oded Schwartz
    0 references
    Shmuel Safra
    0 references
    publication date
    28 September 2006
    0 references
    Mathematics Subject Classification ID
    90C60
    0 references
    90C27
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5058160
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    hardness of approximation
    0 references
    set packing
    0 references
    Wikidata QID
    Q57310535
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2506163&oldid=27008219"
    Powered by MediaWiki