Gives poly-time algorithms for MINSUM capacity augmentation to ensure strong stability in HR with ties, proves NP-hardness for MINMAX, and bounded-increase results when ties are short.
Discrete Applied Mathematics 11(3), 223–232 (1985)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Capacity Modification for Stable Matchings with Ties
Gives poly-time algorithms for MINSUM capacity augmentation to ensure strong stability in HR with ties, proves NP-hardness for MINMAX, and bounded-increase results when ties are short.