Y
Yasufumi Morita
Researcher at Kyoto University
Publications - 4
Citations - 634
Yasufumi Morita is an academic researcher from Kyoto University. The author has contributed to research in topics: Stable marriage problem & Approximation algorithm. The author has an hindex of 4, co-authored 4 publications receiving 585 citations.
Papers
More filters
Journal ArticleDOI
Hard variants of stable marriage
TL;DR: This is the first comprehensive study of variants of the Stable Marriage Problem in which the preference lists of the participants are not necessarily complete and not necessarily totally ordered, and gives a 2-approximation algorithm for the problems of finding a stable matching of maximum or minimum size.
Book ChapterDOI
Stable Marriage with Incomplete Lists and Ties
TL;DR: This paper shows that the situation changes substantially if the problem not only becomes NP-hard, but also the optimal cost version has no approximation algorithm achieving the approximation ratio of N1-Ɛ, where N is the instance size, unless P=NP.
Journal ArticleDOI
Approximability results for stable marriage problems with ties
Magnús M. Halldórsson,Robert W. Irving,Kazuo Iwama,David F. Manlove,Shuichi Miyazaki,Yasufumi Morita,Sandy Scott +6 more
TL;DR: It is proved that there are constants ?? such that each of the problems of approximating a maximum and minimum cardinality stable matching within factors of
Book ChapterDOI
Inapproximability Results on Stable Marriage Problems
TL;DR: It is shown here that it is APX-hard to approximate the maximum cardinality stable matching with incomplete lists and ties and an optimal ?