``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: ``Almost stable matchings in the roommates problem with bounded preference lists |
scientific article; zbMATH DE number 6049376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ``Almost stable'' matchings in the roommates problem with bounded preference lists |
scientific article; zbMATH DE number 6049376 |
Statements
``Almost stable'' matchings in the roommates problem with bounded preference lists (English)
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
0.942870318889618
0 references
0.9113070964813232
0 references
0.9104673862457277
0 references
0.8871403336524963
0 references
0.8704416751861572
0 references
