Two problems in max-size popular matchings (Q2415362)

From MaRDI portal
Revision as of 02:45, 18 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128320464, #quickstatements; #temporary_batch_1723941302328)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two problems in max-size popular matchings
scientific article

    Statements

    title
    Two problems in max-size popular matchings (English)
    0 references
    author
    Florian Brandl
    0 references
    Telikepalli Kavitha
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 May 2019
    0 references
    zbMATH Keywords
    matchings under preferences
    0 references
    Gale-Shapley algorithm
    0 references
    linear programming duality
    0 references
    NP-hardness
    0 references
    cites work
    Popular Matchings
    0 references
    Q5136309
    0 references
    Q3995616
    0 references
    Q5417703
    0 references
    Q2721985
    0 references
    Q4418671
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91B68
    0 references
    68Q17
    0 references
    90C05
    0 references
    zbMATH DE Number
    7057337
    0 references
    OpenAlex ID
    W2915248511
    0 references
    Wikidata QID
    Q128320464
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2415362&oldid=37601953"
    Powered by MediaWiki