| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
| 発行日 |
|
| 収録物名 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連DOI |
|
| 関連DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連URI |
|
| 関連HDL |
|
| 関連ISBN |
|
| 関連HDL |
|
| 関連HDL |
|
| 関連情報 |
|
|
|
|
|
| 概要 |
The popular matching problem introduced by Abraham, Irving, Kavitha, and Mehlhorn is one of assignment problems in strategic situations. It is known that a given instance of this problem may admit no ...popular matching. For coping with such instances, Wu, Lin, Wang, and Chao introduced the popular condensation problem whose goal is to transform a given instance so that it has a popular matching by deleting a minimum number of agents. In this paper, we consider a matroid generalization of the popular condensation problem, and give a polynomial-time algorithm for this problem.続きを見る
|
Mendeley出力
