30th International Workshop on Combinatorial Algorithms (IWOCA 2019), Best Paper Award,An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number小林靖明 小林佑輔 宮崎修一 玉置卓
2009年11月
電子情報通信学会, ISSソサイエティ活動功労賞宮崎修一
2007年5月
電子情報通信学会, 猪瀬賞(年間最優秀論文賞),A (2-c log N/N)-Approximation Algorithm for the Stable Marriage Problem岩間一雄 宮崎修一 岡本和也
Discrete Mathematics, Algorithms and Applications 16(05) 2350057-1-2350057-39 2024年7月 [査読有り]
In the online facility assignment problem [Formula: see text], there exist [Formula: see text] servers [Formula: see text] on a metric space where each [Formula: see text] has an integer capacity [Formula: see text] and a request arrives one-by-on...
International Journal of Foundations of Computer Science 34(07) 853-873 2023年6月 [査読有り]
This paper has two objectives. One is to give a linear time algorithm that solves the stable roommates problem (i.e., obtains one stable matching) using the stable marriage problem. The idea is that a stable matching of a roommate instance [Formul...
Discrete Mathematics, Algorithms and Applications 13(06) 2021年12月 [査読有り]
In the online metric matching problem, there are servers on a given metric space and requests are given one-by-one. The task of an online algorithm is to match each request immediately and irrevocably with one of the unused servers. In this paper,...
Given the same amount of hardware resource and bandwidth limitation, networks with optimal configurations enable Internet service providers to provide a lower end-to-end latency service for clients to use. In the case of designing VLAN, due to the...
M Halldorsson   K Iwama   S Miyazaki   H Yanagisawa   
COMPUTING AND COMBINATORICS (COCOON 2003), PROCEEDINGS 2003年 SPRINGER-VERLAG BERLIN
While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for incomplete preference lists and ties in the preferences. Either variation is po...
MM Halldorsson   K Iwama   S Miyazaki   H Yanagisawa   
ALGORITHMS (ESA 2003), PROCEEDINGS 2003年 SPRINGER-VERLAG BERLIN
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivi...
M Halldorsson   K Iwama   S Miyazaki   Y Morita   
THEORETICAL INFORMATICS (LATIN 2002) 2002年 SPRINGER-VERLAG BERLIN
The stable marriage problem has received considerable attention both due to its practical applications as well as its mathematical structure. While the original problem has all participants rank all members of the opposite sex in a strict order of...
MM Halldorsson   K Iwama   S Miyazaki   S Taketomi   
COMPUTING AND COMBINATORICS (COCOON 2000), PROCEEDINGS 2000年 SPRINGER-VERLAG BERLIN
At each step of the online independent set problem, we axe given a vertex v and its edges to the previously given vertices. We are to decide whether or not to select v as a member of an independent set. Our goal is to maximize the size of the inde...