{"id":145692,"updated":"2025-01-20T18:16:24.976186+00:00","links":{},"created":"2025-01-19T00:21:17.877534+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00145692","sets":["6201:6202:9108:8357"]},"path":["8357"],"owner":"10","recid":"145692","title":["最大重みクリーク問題に対する分枝限定法に基づく近似解法に関する研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-09-18"},"_buckets":{"deposit":"d1351cbb-94c2-411a-8ed9-f8e792a1a95e"},"_deposit":{"id":"145692","pid":{"type":"depid","value":"145692","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"最大重みクリーク問題に対する分枝限定法に基づく近似解法に関する研究","author_link":["225379"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最大重みクリーク問題に対する分枝限定法に基づく近似解法に関する研究"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェアとアルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"19","publish_date":"2015-09-18","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_19_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神戸大学、神戸大学、神戸大学、神戸大学"}]},"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/145692/files/IPSJ-Kansai2015009.pdf","label":"IPSJ-Kansai2015009.pdf"},"date":[{"dateType":"Available","dateValue":"2017-09-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Kansai2015009.pdf","filesize":[{"value":"200.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"68428bd2-e427-4290-836e-4649c99addf6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_19_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"芝野, 悟、山口 一章、斎藤 寿樹、増田 澄男"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_19_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1884-197X","subitem_source_identifier_type":"ISSN"}]},"item_19_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"最大重みクリーク問題に対する近似解法の研究。分枝限定法に基づく手法であり、部分問題の探索順序に工夫を加えることで近似解法の特徴と厳密解法の特徴を併せ持ったアルゴリズムを目指す。","subitem_description_type":"Other"}]},"item_19_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"2015年度 情報処理学会関西支部 支部大会 講演論文集"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2015-09-18","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2015"}]},"relation_version_is_last":true,"weko_creator_id":"10"}}