Search


Current filters:
Start a new search
Add filters:

Use filters to refine the search results.


Results 1-10 of 37 (Search time: 0.016 seconds).
Item hits:
BibliographyContents
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
file type icon 
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
file type icon 
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
file type icon 
Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem
  Matsuyama, Yuki; Miyazaki, Shuichi (2021)
  Journal of Information Processing, 29: 166-173
file type icon 
局所探索法による安定結婚問題の近似
  岡本, 和也; 宮崎, 修一; 岩間, 一雄 (2004-04-15)
  電子情報通信学会技術研究報告, 104(16): 53-60
file type icon 
ルータ上のバッファ管理問題に対するオンラインアルゴリズム
  宮崎, 修一 (2006-04)
  電子情報通信学会誌, 89(4): 299-303
file type icon 
オンラインフレーム転送量最大化問題における競合比の改良
  小林, 浩二; 川原, 純; 宮崎, 修一 (2014-04-24)
  電子情報通信学会技術研究報告, 114(19): 37-44
file type icon 
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
file type icon 
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
file type icon 
共有メモリ型スイッチにおけるオンラインバッファ管理アルゴリズムの競合比の改良
  小林, 浩二; 宮崎, 修一; 岡部, 寿男 (2005-06-17)
  電子情報通信学会技術研究報告, 105(144): 17-22
file type icon