Faster and Simpler Approximation of Stable Matchings
AbstractWe give a -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Paluch, K. Faster and Simpler Approximation of Stable Matchings. Algorithms 2014, 7, 189-202.
Paluch K. Faster and Simpler Approximation of Stable Matchings. Algorithms. 2014; 7(2):189-202.Chicago/Turabian Style
Paluch, Katarzyna. 2014. "Faster and Simpler Approximation of Stable Matchings." Algorithms 7, no. 2: 189-202.