{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032011","sets":["1164:2592:2640:2641"]},"path":["2641"],"owner":"1","recid":"32011","title":["木構造の動的ネットワークにおける施設配置問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-11-27"},"_buckets":{"deposit":"26f023da-f61d-4e99-bcd6-d2b6763e7581"},"_deposit":{"id":"32011","pid":{"type":"depid","value":"32011","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":"Optimal Sink Location Problem for Dynamic Flows in a Tree Network","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-11-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka","subitem_text_language":"en"},{"subitem_text_value":"Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka","subitem_text_language":"en"},{"subitem_text_value":"Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka","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/32011/files/IPSJ-AL01081005.pdf"},"date":[{"dateType":"Available","dateValue":"2003-11-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01081005.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":"1b4ac7aa-c013-4e58-8181-5f3d0d4fae3b","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":"間々田, 聡子"},{"creatorName":"牧野, 和久"},{"creatorName":"藤重, 悟"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoko, Mamada","creatorNameLang":"en"},{"creatorName":"Kazuhisa, Makino","creatorNameLang":"en"},{"creatorName":"Satoru, Fujishige","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":"本論文では，木構造ネットワークにおける動的フロー問題と施設配置問題を統合した問題を考察する．これは，木構造ネットワークと各点に供給量が与えられているとき，その全ての供給量を最速に輸送するような出口νを求める問題である．この問題は木構造ネットワークにおける１-センター問題の動的フロー版と見なすことができる．我々は，この施設配置問題に対するO(n2)時間アルゴリズムを与える．ただし，nはネットワークの点数である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper we consider a compound problem of dynamic flows and sink location in a tree network. Given a dynamic flow network of tree structure with initial supplies at vertices, the problem is to find a vertex ν as a sink in the network such that we can send all the initial suplies to ν as quick as possible. This problem can be regarded as a dynamic flow version of the 1-centerin problem in a tree network. We present an O(n2) time algorithm for the sink location problem, where n is the number of vertices in the network.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"42","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"35","bibliographicIssueDates":{"bibliographicIssueDate":"2001-11-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"115(2001-AL-081)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32011,"updated":"2025-01-22T16:22:13.072888+00:00","links":{},"created":"2025-01-18T23:01:12.356679+00:00"}