On Stable Marriages and Greedy Matchings
Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. In this paper we consider the relationships between these two areas. In particular we show that several problems related to computing greedy matchings can be formulated as stable marriage problems and as a consequence several recently proposed algorithms for computing greedy matchings are in fact special cases of well known algorithms for the stable marriage problem. However, in terms of implementations and practical scalable solutions on modern hardware, the greedy matching community has made considerable progress. We show that due to the strong relationship between these two fields many of these results are also applicable for solving stable marriage problems.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1339043
- Report Number(s):
- PNNL-SA-119688; KJ0401000
- Resource Relation:
- Conference: Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, October 10-12, 2016, Albuquerque, New Mexico, 92-101
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)