Kyoto University Research Information Repository: 検索

DSpace

Kyoto University

検索

検索結果表示: 11-20 / 29.

前
1
2
3
次

検索結果:

書誌情報	ファイル
Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki (2011) Lecture Notes in Computer Science, 6648: 440-451
The Hospitals/Residents Problem with Quota Lower Bounds Hamada, Koki; Iwama, Kazuo; Miyazaki, Shuichi (2011) Lecture Notes in Computer Science, 6924: 180-191
Improving the Competitive Ratios of the Seat Reservation Problem Miyazaki, Shuichi; Okamoto, Kazuya (2010) IFIP Advances in Information and Communication Technology, 323: 328-339
A Survey of the Stable Marriage Problem and Its Variants Iwama, Kazuo; Miyazaki, Shuichi (2008) Informatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. International Conference on: 131-136
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki (2014-03) Algorithmica, 68(3): 758-775
Better Bounds for Online k-Frame Throughput Maximization in Network Switches Kawahara, Jun; Kobayashi, Koji M.; Miyazaki, Shuichi (2013) Lecture Notes in Computer Science, 8283: 218-228
The Hospitals/Residents Problem with Lower Quotas Hamada, Koki; Iwama, Kazuo; Miyazaki, Shuichi (2016-01) Algorithmica, 74(1): 440-465
Approximability of two variants of multiple knapsack problems Miyazaki, Shuichi; Morimoto, Naoyuki; Okabe, Yasuo (2015) Lecture Notes in Computer Science, 9079: 365-376
An improved approximation lower bound for finding almost stable maximum matchings Hamada, Koki; Iwama, Kazuo; Miyazaki, Shuichi (2009-08-31) Information Processing Letters, 109(18): 1036-1040
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2017-05-02) Theoretical Computer Science, 675: 27-42