検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果:
| 書誌情報 | ファイル |
|---|---|
| Strongly Stable and Maximum Weakly Stable Noncrossing Matchings Hamada, Koki; Miyazaki, Shuichi; Okamoto, Kazuya (2021-09) Algorithmica, 83(9): 2678-2696 |  |
| Competitive analysis for two variants of online metric matching problem Itoh, Toshiya; Miyazaki, Shuichi; Satake, Makoto (2021-12) Discrete Mathematics, Algorithms and Applications, 13(6) | |
| A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties Huang, Chien-Chung; Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki (2015) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), 40: 361-380 | |
| Improved approximation bounds for the Student-Project Allocation problem with preferences over projects Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki (2012-05) Journal of Discrete Algorithms, 13: 59-66 | |
| Finding Witnesses for Stability in the Hospitals/Residents Problem Lee, Minseon; Miyazaki, Shuichi; Iwama, Kazuo (2015-03-15) Journal of Information Processing, 23(2): 202-209 | |
| Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem Matsuyama, Yuki; Miyazaki, Shuichi (2021) Journal of Information Processing, 29: 166-173 | |
| Jointly stable matchings Miyazaki, Shuichi; Okamoto, Kazuya (2017) Leibniz International Proceedings in Informatics, LIPIcs, 92: 56:1-56:12 | |
| Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2008-09-11) 電子情報通信学会技術研究報告, 108(206): 71-78 | |
| A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2007-06-29) 電子情報通信学会技術研究報告, 107(127): 63-70 | |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2008) Lecture Notes in Computer Science: 64-76 | |
絞り込み
キーワード
発行日
資料種別