Popular Matching in Roommates Setting Is NP-hard (Q5065631)

From MaRDI portal
Revision as of 16:11, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
Popular Matching in Roommates Setting Is NP-hard
No description defined

    Statements

    title
    Popular Matching in Roommates Setting Is NP-hard (English)
    0 references
    DOI
    10.1145/3442354
    0 references
    author
    Sushmita Gupta
    0 references
    Pranabendu Misra
    0 references
    Saket Saurabh
    0 references
    Meirav Zehavi
    0 references
    publication date
    22 March 2022
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C70
    0 references
    91B68
    0 references
    zbMATH DE Number
    7495899
    0 references
    zbMATH Keywords
    NP-hardness
    0 references
    popular matching
    0 references
    OpenAlex ID
    W3140823561
    0 references
    arXiv ID
    1803.09370
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5065631&oldid=34062052"
    Powered by MediaWiki