<preprint>
Popular Matchings under Matroid Constraints
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
Abstract | In this paper, we consider a matroid generalization of the popular matching problem introduced by Abraham, Irving, Kavitha and Mehlhorn, and present a polynomial-time algorithm for this problem. |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
MI2014-1 | 124 KB | 298 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Notes | |
Created Date | 2014.02.07 |
Modified Date | 2020.09.30 |