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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6049376 / rank
 
Normal rank
Property / zbMATH Keywords
 
stable roommates problem
Property / zbMATH Keywords: stable roommates problem / rank
 
Normal rank
Property / zbMATH Keywords
 
blocking pairs
Property / zbMATH Keywords: blocking pairs / rank
 
Normal rank
Property / zbMATH Keywords
 
APX-hardness
Property / zbMATH Keywords: APX-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time algorithm
Property / zbMATH Keywords: polynomial-time algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040118257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size versus stability in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instability of matchings in decentralized markets with various preference structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost stable matchings by truncating the Gale-Shapley algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation lower bound for finding almost stable maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hospitals/Residents Problem with Quota Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the solvability probability of a random stable roommates instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a complete stable matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings and stable partitions<sup>∗</sup> / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 5 July 2024

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