Search
Add filters:
Use filters to refine the search results.
Item hits:
| Bibliography | Contents |
|---|---|
| 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 | |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2009-07-17) Algorithms, 2(3): 953-972 | |
| Better bounds for online k-frame throughput maximization in network switches Kawahara, Jun; Kobayashi, Koji M.; Miyazaki, Shuichi (2017-01-02) Theoretical Computer Science, 657(Part B): 173-190 | |
| On the advice complexity of online bipartite matching and online stable marriage Miyazaki, Shuichi (2014-12) Information Processing Letters, 114(12): 714-717 | |
| Competitive Analysis for Two Variants of Online Metric Matching Problem Itoh, Toshiya; Miyazaki, Shuichi; Satake, Makoto (2020) Combinatorial Optimization and Applications: 486-498 | |
Discover
Subject
Date issued
Document type