Search
Add filters:
Use filters to refine the search results.
Item hits:
| Bibliography | Contents |
|---|---|
| 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 | |
| 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 | |
| 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 | |
| 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 | |
Discover
Subject
Document type