{"created":"2023-05-15T15:31:59.932862+00:00","id":4752,"links":{},"metadata":{"_buckets":{"deposit":"6002926c-66f4-4d3b-851d-c471ed5f7f87"},"_deposit":{"created_by":3,"id":"4752","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"4752"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00004752","sets":["1:15"]},"author_link":["10382"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2014-10-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"41","bibliographicPageStart":"39","bibliographicVolumeNumber":"1","bibliographic_titles":[{"bibliographic_title":"SOP Transactions on Applied Mathematics"}]}]},"item_1_description_18":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We show that the conventional 2-approximation algorithm for the classical 0?1 knapsack problem does not work for the collapsing knapsack problem in general. We also show that the algorithm will work for the problem under some special conditions.","subitem_description_type":"Abstract"}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Scientific Online Publishing"}]},"item_1_relation_8":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.15764/AM.2014.03004","subitem_relation_type_select":"DOI"}}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.scipublish.com/journals/AM/papers/847"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"410","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"数学","subitem_subject_scheme":"Other"}]},"item_1_version_type_15":{"attribute_name":"テキストバージョン","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Iida, Hiroshi"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-26"}],"displaytype":"detail","filename":"V1N3-004.pdf","filesize":[{"value":"130.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"V1N3-004.pdf","url":"https://barrel.repo.nii.ac.jp/record/4752/files/V1N3-004.pdf"},"version_id":"ebd3d6bf-927f-4936-b9f2-2d7a088d8015"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Combinatorial Optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"Collapsing Knapsack Problem","subitem_subject_scheme":"Other"},{"subitem_subject":"2-approximation Algorithm","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":"Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem"}]},"item_type_id":"1","owner":"3","path":["4","15"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-11-13"},"publish_date":"2014-11-13","publish_status":"0","recid":"4752","relation_version_is_last":true,"title":["Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-20T08:00:10.752920+00:00"}