Simultaneous matchings: Hardness and approximation (Q931730)

From MaRDI portal
Revision as of 15:21, 7 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
Simultaneous matchings: Hardness and approximation
scientific article

    Statements

    Simultaneous matchings: Hardness and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matchings
    0 references
    perfect matchings
    0 references
    constraint programming
    0 references
    NP-completeness
    0 references
    optimisation
    0 references
    hardness of approximation
    0 references
    bipartite graph
    0 references