Popular Matchings under Matroid Constraints - Collections

＜preprint＞
Popular Matchings under Matroid Constraints

Creator	Author PID K004444 Creator Name Kamiyama, Naoyuki 神山, 直之カミヤマ, ナオユキ Affiliation Affiliation Name Institute of Mathematics for Industry, Kyushu University 九州大学マス・フォア・インダストリ研究所
Language	English
Publisher	Faculty of Mathematics, Kyushu University
Publisher	九州大学大学院数理学研究院
Date	2014-01-06
Source Title	MI Preprint Series
Vol	2014-1
Publication Type	Author's Original
Access Rights	open access
Related DOI	MI Preprint Series \|\| 2013-17 \|\| p1-11
Related DOI	http://www.math.kyushu-u.ac.jp/
Related URI	MI Preprint Series \|\| 2013-17 \|\| p1-11
Related URI	http://www.math.kyushu-u.ac.jp/
Relation	MI Preprint Series \|\| 2013-17 \|\| p1-11
Relation	http://www.math.kyushu-u.ac.jp/
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.

File	FileType	Size	Views	Description
MI2014-1	pdf	124 KB	276

Record ID	1398520
Peer-Reviewed	Unrefereed
Notes	Global COE Program Education-and-Research Hub for Mathematics-for-Industry
	グローバルCOEプログラム「マス･フォア･インダストリ教育研究拠点」
	This work is partly supported by KAKENHI(25730006).
	論文の一部は科研費による(25730006)
Created Date	2014.02.07
Modified Date	2020.09.30