{"created":"2023-06-20T13:00:37.058713+00:00","id":4685,"links":{},"metadata":{"_buckets":{"deposit":"5c81b239-0976-4d14-996b-0a3a57eb7ee3"},"_deposit":{"created_by":2,"id":"4685","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"4685"},"status":"published"},"_oai":{"id":"oai:fun.repo.nii.ac.jp:00004685","sets":["22:33","25:81:107"]},"author_link":["116","8090"],"item_9_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-01","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"88","bibliographicPageStart":"79","bibliographic_titles":[{"bibliographic_title":"The 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)"}]}]},"item_9_description_3":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"施設配置問題のようなNP困難な組合せ最適化問題について、ペナルティが劣モジュラ関数として与えられる自然な問題設定を扱っている。劣モジュラ関数の離散凸性を活かしたアルゴリズムを与えている。","subitem_description_type":"Abstract"}]},"item_9_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"ACM, SIAM"}]},"item_9_relation_7":{"attribute_name":"ISBN","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"9780898716245","subitem_relation_type_select":"ISBN"}}]},"item_9_select_10":{"attribute_name":"単著共著","attribute_value_mlt":[{"subitem_select_item":"共著/joint"}]},"item_9_select_8":{"attribute_name":"査読有無","attribute_value_mlt":[{"subitem_select_item":"あり/yes"}]},"item_9_select_9":{"attribute_name":"研究業績種別","attribute_value_mlt":[{"subitem_select_item":"国際会議/International Conference"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_14cb"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chudak, Fabian"}],"nameIdentifiers":[{"nameIdentifier":"8090","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nagano, Kiyohito"}],"nameIdentifiers":[{"nameIdentifier":"116","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"20515176","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=20515176"}]}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization"}]},"item_type_id":"9","owner":"2","path":["33","107"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-09-03"},"publish_date":"2013-09-03","publish_status":"0","recid":"4685","relation_version_is_last":true,"title":["Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2023-06-20T13:23:13.534616+00:00"}