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 - 2014

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The popular matching and condensation problems under matroid constraints'. Together they form a unique fingerprint.

Cite this