``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844)

From MaRDI portal
Revision as of 17:18, 9 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
``Almost stable'' matchings in the roommates problem with bounded preference lists
scientific article

    Statements

    ``Almost stable'' matchings in the roommates problem with bounded preference lists (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    stable roommates problem
    0 references
    blocking pairs
    0 references
    APX-hardness
    0 references
    polynomial-time algorithm
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references