WEKO3
-
RootNode
アイテム
Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms
http://hdl.handle.net/10091/0002001211
http://hdl.handle.net/10091/00020012117e2c915f-3bd3-467f-ac45-f67f952e6f86
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
16K00033_2.pdf
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-10-24 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| DOI | ||||||||||||
| 関連タイプ | isIdenticalTo | |||||||||||
| 関連識別子 | https://doi.org/10.1587/transinf.2020FCP0004 | |||||||||||
| 関連名称 | 10.1587/transinf.2020FCP0004 | |||||||||||
| キーワード | ||||||||||||
| 主題 | bin packing problem, online algorithm, competitive analysis, mathematical optimization | |||||||||||
| 資源タイプ | ||||||||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| タイプ | journal article | |||||||||||
| 著者 |
Fujiwara, Hiroshi
× Fujiwara, Hiroshi
× Wanikawa, Yuta
× Yamamoto, Hiroaki
|
|||||||||||
| 信州大学研究者総覧へのリンク | ||||||||||||
| 氏名 | 藤原, 洋志 | |||||||||||
| URL | https://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html | |||||||||||
| 信州大学研究者総覧へのリンク | ||||||||||||
| 氏名 | 山本, 博章 | |||||||||||
| URL | https://soar-rd.shinshu-u.ac.jp/profile/ja.ONfpOCSh.html | |||||||||||
| 引用 | ||||||||||||
| 内容記述 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E104D(3) : 362-369(2021) | |||||||||||
| 書誌情報 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 巻 E104D, 号 3, p. 362-369, 発行日 2021-03-01 |
|||||||||||
| 抄録 | ||||||||||||
| 内容記述 | The performance of online algorithms for the bin packing problem is usually measured by the asymptotic approximation ratio. However, even if an online algorithm is explicitly described, it is in general difficult to obtain the exact value of the asymptotic approximation ratio. In this paper we show a theorem that gives the exact value of the asymptotic approximation ratio in a closed form when the item sizes and the online algorithm satisfy some conditions. Moreover, we demonstrate that our theorem serves as a powerful tool for the design of online algorithms combined with mathematical optimization. | |||||||||||
| 資源タイプ（コンテンツの種類） | ||||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||
| 収録物識別子 | 1745-1361 | |||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AA10826272 | |||||||||||
| 権利 | ||||||||||||
| 権利情報 | © 2021 The Institute of Electronics, Information and Communication Engineers | |||||||||||
| 出版タイプ | ||||||||||||
| 出版タイプ | VoR | |||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||
Share
Cite as
Fujiwara, Hiroshi, Wanikawa, Yuta, Yamamoto, Hiroaki, 2021, Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms: 362–369 p.
Loading...
