Abstract
In this paper, we first consider a matroid generalization of the popular matching problem (without ties) introduced by Abraham, Irving, Kavitha, and Mehlhorn, and give a polynomial-time algorithm for this problem. In the second half of this paper, we consider the problem of transforming a given instance of the popular matching problem (without ties) by deleting a minimum number of applicants so that it has a popular matching under matroid constraints. This problem is a matroid generalization of the popular condensation problem proposed by Wu, Lin, Wang, and Chao. By using the results in the first half, we give a polynomial-time algorithm for this problem.
| Original language | English |
|---|---|
| Pages (from-to) | 713-728 |
| Number of pages | 16 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 8881 |
| DOIs | |
| Publication status | Published - Jan 1 2014 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
The popular matching and condensation problems under matroid constraints. / Kamiyama, Naoyuki.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8881, 01.01.2014, p. 713-728.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - The popular matching and condensation problems under matroid constraints
AU - Kamiyama, Naoyuki
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In this paper, we first consider a matroid generalization of the popular matching problem (without ties) introduced by Abraham, Irving, Kavitha, and Mehlhorn, and give a polynomial-time algorithm for this problem. In the second half of this paper, we consider the problem of transforming a given instance of the popular matching problem (without ties) by deleting a minimum number of applicants so that it has a popular matching under matroid constraints. This problem is a matroid generalization of the popular condensation problem proposed by Wu, Lin, Wang, and Chao. By using the results in the first half, we give a polynomial-time algorithm for this problem.
AB - In this paper, we first consider a matroid generalization of the popular matching problem (without ties) introduced by Abraham, Irving, Kavitha, and Mehlhorn, and give a polynomial-time algorithm for this problem. In the second half of this paper, we consider the problem of transforming a given instance of the popular matching problem (without ties) by deleting a minimum number of applicants so that it has a popular matching under matroid constraints. This problem is a matroid generalization of the popular condensation problem proposed by Wu, Lin, Wang, and Chao. By using the results in the first half, we give a polynomial-time algorithm for this problem.
UR - http://www.scopus.com/inward/record.url?scp=84921451838&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84921451838&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-12691-3_53
DO - 10.1007/978-3-319-12691-3_53
M3 - Article
AN - SCOPUS:84921451838
VL - 8881
SP - 713
EP - 728
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -