{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032024","sets":["1164:2592:2640:2642"]},"path":["2642"],"owner":"1","recid":"32024","title":["最悪性能比が2.7834二次元調和算法の提案と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-09-25"},"_buckets":{"deposit":"f03ca19d-e276-4f2d-9ca2-d99837e1de49"},"_deposit":{"id":"32024","pid":{"type":"depid","value":"32024","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"最悪性能比が2.7834二次元調和算法の提案と評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最悪性能比が2.7834二次元調和算法の提案と評価"},{"subitem_title":"A Two-Dimensional Harmonic Algorithm with Performance Ratio 2.7834","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-09-25","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島大学／大連理工大学"},{"subitem_text_value":"広島大学"},{"subitem_text_value":"大連理工大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hiroshima University,Japan/Dalian University of Technology, The Peoples Republic of China","subitem_text_language":"en"},{"subitem_text_value":"Hiroshima University, Japan","subitem_text_language":"en"},{"subitem_text_value":"Dalian University of Technology,  The Peoples Republic of China","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/32024/files/IPSJ-AL01080007.pdf"},"date":[{"dateType":"Available","dateValue":"2003-09-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01080007.pdf","filesize":[{"value":"181.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6800609a-7342-4927-b4d5-44b892ecd5bd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"HanXin"},{"creatorName":"藤田, 聡"},{"creatorName":"郭禾"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Xin, Han","creatorNameLang":"en"},{"creatorName":"Satoshi, Fujita","creatorNameLang":"en"},{"creatorName":"He, Guo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"箱詰め問題は 組み合わせ最適化問題における基本的な問題の１つである。60 70年代から、ずっと 注目され、たくさんの結果が出た.本論では、二次元の箱詰め問題について考察する。以下では 二次元調和算法の改良版であるRTDHを 提案し、その性能を理論的に評価する。評価の結果、提案アルゴリズムの最悪性能比が 2.7834以下であることが示される。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we study an on-line version of the two-dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit-square bins in an on-line manner. An on-line algorithm  RTDH (Refined Two Dimensional  HARMONIC)is proposed and analyzed.  We show that  RTDH can achieve an asymptotic worst case ratio of less than 2.7834,that beats the best known bound 2.85958.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"50","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"43","bibliographicIssueDates":{"bibliographicIssueDate":"2001-09-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"93(2001-AL-080)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:12.954850+00:00","updated":"2025-01-22T16:21:58.128366+00:00","id":32024}