Santa claus meets hypergraph matchings (Q3189065)

From MaRDI portal
Revision as of 20:14, 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
Santa claus meets hypergraph matchings
scientific article

    Statements

    title
    Santa claus meets hypergraph matchings (English)
    0 references
    author
    Arash Asadpour
    0 references
    Amin Saberi
    0 references
    Uriel Feige
    0 references
    publication date
    9 September 2014
    0 references
    zbMATH Keywords
    bipartite hypergraphs
    0 references
    Santa Claus problem
    0 references
    hypergraph matchings
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C65
    0 references
    05C70
    0 references
    05C85
    0 references
    90B80
    0 references
    91B32
    0 references
    zbMATH DE Number
    6341936
    0 references
    OpenAlex ID
    W2001927417
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3189065&oldid=31710173"
    Powered by MediaWiki