{"created":"2022-10-25T00:17:49.846413+00:00","id":2001211,"links":{},"metadata":{"_buckets":{"deposit":"2f0dda72-cdb2-49ee-958d-b0f66a76613d"},"_deposit":{"id":"2001211","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2001211"},"status":"published"},"_oai":{"id":"oai:soar-ir.repo.nii.ac.jp:02001211","sets":["1221:1222"]},"author_link":[],"control_number":"2001211","item_1628147817048":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_6_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"369","bibliographicPageStart":"362","bibliographicVolumeNumber":"E104D","bibliographic_titles":[{"bibliographic_title":"IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS"}]}]},"item_6_description_20":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Abstract"}]},"item_6_description_30":{"attribute_name":"資源タイプ（コンテンツの種類）","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_type":"Other"}]},"item_6_description_5":{"attribute_name":"引用","attribute_value_mlt":[{"subitem_description":"IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E104D(3) : 362-369(2021)","subitem_description_type":"Other"}]},"item_6_link_3":{"attribute_name":"信州大学研究者総覧へのリンク","attribute_value_mlt":[{"subitem_link_text":"藤原, 洋志","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html"},{"subitem_link_text":"山本, 博章","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.ONfpOCSh.html"}]},"item_6_relation_48":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"10.1587/transinf.2020FCP0004"}],"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1587/transinf.2020FCP0004","subitem_relation_type_select":"DOI"}}]},"item_6_rights_62":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© 2021 The Institute of Electronics, Information and Communication Engineers"}]},"item_6_source_id_35":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1745-1361","subitem_source_identifier_type":"EISSN"}]},"item_6_source_id_40":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10826272","subitem_source_identifier_type":"NCID"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fujiwara, Hiroshi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Wanikawa, Yuta","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamamoto, Hiroaki","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-10-24"}],"filename":"16K00033_2.pdf","format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"16K00033_2.pdf","url":"https://soar-ir.repo.nii.ac.jp/record/2001211/files/16K00033_2.pdf"},"version_id":"339845f4-2831-4eab-a21c-9c7a00df4bf0"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"bin packing problem","subitem_subject_scheme":"Other"},{"subitem_subject":"online algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"competitive analysis","subitem_subject_scheme":"Other"},{"subitem_subject":"mathematical optimization","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms","subitem_title_language":"en"}]},"item_type_id":"6","owner":"1","path":["1222"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2022-10-24"},"publish_date":"2022-10-24","publish_status":"0","recid":"2001211","relation_version_is_last":true,"title":["Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-12-14T04:15:36.527553+00:00"}