Matchings with lower quotas: algorithms and complexity (Q1702126)

From MaRDI portal
Revision as of 20:14, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Matchings with lower quotas: algorithms and complexity
scientific article

    Statements

    Matchings with lower quotas: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum matching
    0 references
    many-to-one matching
    0 references
    project allocation
    0 references
    inapproximability
    0 references
    bounded treewidth
    0 references