Matchings with lower quotas: algorithms and complexity (Q1702126)

From MaRDI portal
Revision as of 04:48, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(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

    title
    Matchings with lower quotas: algorithms and complexity (English)
    0 references
    author
    Ashwin Arulselvan
    0 references
    Ágnes Cseh
    0 references
    Martin Groß
    0 references
    David F. Manlove
    0 references
    Jannik Matuschke
    0 references
    published in
    Algorithmica
    0 references
    publication date
    28 February 2018
    0 references
    zbMATH Keywords
    maximum matching
    0 references
    many-to-one matching
    0 references
    project allocation
    0 references
    inapproximability
    0 references
    bounded treewidth
    0 references
    cites work
    Q4291429
    0 references
    Q3138921
    0 references
    Antifactors of graphs
    0 references
    Matching with quorums
    0 references
    Q5710169
    0 references
    Q3012402
    0 references
    Q3002782
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q25
    0 references
    68W25
    0 references
    zbMATH DE Number
    6844601
    0 references
    OpenAlex ID
    W2470524007
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1702126&oldid=38706990"
    Powered by MediaWiki