``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.01.022 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.01.022 / rank | |||
Normal rank | |||
Latest revision as of 17:18, 9 December 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
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
