{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032038","sets":["1164:2592:2640:2643"]},"path":["2643"],"owner":"1","recid":"32038","title":["劣モジュラ関数最小化の完全に組合せ的なアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-07-27"},"_buckets":{"deposit":"c4ca85ce-f920-4375-acc3-51862003c623"},"_deposit":{"id":"32038","pid":{"type":"depid","value":"32038","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"劣モジュラ関数最小化の完全に組合せ的なアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"劣モジュラ関数最小化の完全に組合せ的なアルゴリズム"},{"subitem_title":"A Fully Combinatorial Algorithm for Submodular Function Minimization","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-07-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学情報理工学系研究科数理情報学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical Informatics Graduate School of Information Science and Technology University of Tokyo","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/32038/files/IPSJ-AL01079010.pdf"},"date":[{"dateType":"Available","dateValue":"2003-07-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01079010.pdf","filesize":[{"value":"1.1 MB"}],"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":"445326f8-f1db-4c94-9e83-006eb16b2b6e","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":"岩田, 覚"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoru, Iwata","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":"加減算と大小比較のみを用いて、劣モジュラ関数の最小値を計算する強多項式時間アルゴリズムを提示する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents a strongly polynomial algorithm for general submodular function minimization using only additions, subtraction, comparisons, and oracle calls for function values.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"66","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"2001-07-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"79(2001-AL-079)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32038,"updated":"2025-01-22T16:21:43.443238+00:00","links":{},"created":"2025-01-18T23:01:13.591539+00:00"}