Simultaneous matchings: Hardness and approximation (Q931730)

From MaRDI portal
Revision as of 02:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Simultaneous matchings: Hardness and approximation
scientific article

    Statements

    title
    Simultaneous matchings: Hardness and approximation (English)
    0 references
    author
    Irit Katriel
    0 references
    Meena Mahajan
    0 references
    Martin Kuetz
    0 references
    Khaled M. Elbassioni
    0 references
    publication date
    26 June 2008
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68W25
    0 references
    zbMATH DE Number
    5293397
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q931730&oldid=25879438"
    Powered by MediaWiki