The popular matching and condensation problems under matroid constraints

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)713-728
Number of pages16
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8881
DOIs
Publication statusPublished - Jan 1 2014

Fingerprint

Matroid
Condensation
Polynomials
Matching Problem
Tie
Polynomial-time Algorithm
Generalization

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{e3b50877d82d467b8eb2e44759e76861,
title = "The popular matching and condensation problems under matroid constraints",
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.",
author = "Naoyuki Kamiyama",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-12691-3_53",
language = "English",
volume = "8881",
pages = "713--728",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 -