{"updated":"2025-01-19T13:25:53.379827+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00223365","sets":["1164:2592:11085:11086"]},"path":["11086"],"owner":"44499","recid":"223365","title":["魔女の最適調合問題－非減少部分列の最適化に基づく多次元ソーティング問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-01-12"},"_buckets":{"deposit":"97c149e0-afa1-47f6-a3c4-d2623c718af9"},"_deposit":{"id":"223365","pid":{"type":"depid","value":"223365","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"魔女の最適調合問題－非減少部分列の最適化に基づく多次元ソーティング問題","author_link":["588305","588304"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"魔女の最適調合問題－非減少部分列の最適化に基づく多次元ソーティング問題"},{"subitem_title":"Optimal Formulation of Witch's Potion: Multi-dimensional sorting based on optimization of non-decreasing subsequences","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-01-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"関西学院大学理工学研究科情報科学専攻"},{"subitem_text_value":"関西学院大学理工学研究科情報科学専攻／関西学院大学工学部情報工学課程"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Graduate School of Science and Engineering, Kwansei Gakuin University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Graduate School of Science and Engineering, Kwansei Gakuin University / Course of Computer Science, Department of Engineering, Kwansei Gakuin University","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/223365/files/IPSJ-AL23191002.pdf","label":"IPSJ-AL23191002.pdf"},"date":[{"dateType":"Available","dateValue":"2025-01-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23191002.pdf","filesize":[{"value":"1.2 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":"3becebc3-b17c-4d4c-908a-d76e1bd6a404","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤原, 直紀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"徳山, 豪"}],"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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"d 次元の n 個のベクトル列が与えられたとき，列ベクトルを並べ替えて d×n の行列として考える．行列の様子は列ベクトルの順序によるが，これを目的関数を最大/最小にするような列ベクトルの順列を見つける問題として定式化する．目的関数は，行列の各行に対するファーストフィット非減少部分列の要素の効用の和で定義することで，最大化問題をソーティング問題の自然な一般化として考えることができる．本論文では，d が定数の場合には，多項式時間アルゴリズムが構成できることを示し，d が一般である場合に対しては，集合被覆問題や劣モジュラ最適化との関係を調査し，計算複雑度を考察する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Given a set of n vectors with d dimensions, we consider a d × n matrix arranging them as column vectors. The matrix depends on the order of the vectors, and we consider the problems of finding the optimal permutation of column vectors to maximize/minimize an objective function. Our objective function is defined by using the first-fit maximal non-decreasing subsequences of row vectors of the matrix, and the maximizing problem can be considered as a natural generalization of sorting. We consider the complexity of the problems and give polynomial time algorithms if d is a constant. We also discuss variants of the problems to relate to min-sum set covering and submodular optimization.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-01-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2023-AL-191"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:23:13.995046+00:00","id":223365,"links":{}}