A faster algorithm for the Strongly Stable \(b\)-Matching Problem (Q2294060)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7163795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for the Strongly Stable \(b\)-Matching Problem |
scientific article; zbMATH DE number 7163795 |
Statements
A faster algorithm for the Strongly Stable \(b\)-Matching Problem (English)
0 references
6 February 2020
0 references
stable marriage
0 references
strongly stable matching
0 references
\(b\)-matching
0 references
0.9172336459159852
0 references
0.8637508749961853
0 references
0.8508155345916748
0 references
0.8489264845848083
0 references
