{"created":"2025-01-19T00:56:57.603483+00:00","updated":"2025-01-20T00:58:15.398420+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00191040","sets":["1164:2592:9368:9546"]},"path":["9546"],"owner":"11","recid":"191040","title":["辞書式最適最速到達フロー問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-08-27"},"_buckets":{"deposit":"45bf87d4-8781-478c-a820-19d575191822"},"_deposit":{"id":"191040","pid":{"type":"depid","value":"191040","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"辞書式最適最速到達フロー問題","author_link":["439023"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"辞書式最適最速到達フロー問題"}]},"item_type_id":"4","publish_date":"2018-08-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学／JSTさきがけ"}]},"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/191040/files/IPSJ-AL18169009.pdf","label":"IPSJ-AL18169009.pdf"},"date":[{"dateType":"Available","dateValue":"2020-08-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL18169009.pdf","filesize":[{"value":"679.6 kB"}],"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":"bd06ff84-771b-4323-acfd-7cf6ed73d4bd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"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":"Ford & Fulkerson によって提案された動的ネットワークとは，各辺が容量と移動時間を持つ有向グラフである．動的ネットワーク上の基本的な問題の一つとして避難計画問題がある．この問題の目的は，全てのサプライをシンクまで最も早く流すことのできる動的ネットワーク上の動的フローを求めることである．最速到達フローとは，全ての時刻においてシンクへ到達しているサプライの量を最大化する避難計画問題の解である．シンクの数が 1 つの場合は，最速到達フローが常に存在することが知られている．しかし，シンクが 2 つ以上存在しシンクに容量がある場合は，最速到達フローが存在しない問題例が存在することが知られている．本論文では，この非存在性を回避するために，複数のシンクを持つ動的ネットワークにおける新たな解として辞書式最適最速到達フローを提案する．この解は，Megiddo が提案した通常のネットワークフローにおける辞書式最適フローから発想を得たものである．本論文では，一般の動的ネットワークにおける辞書式最適最速到達フローを求める擬多項式時間アルゴリズムを提案する．さらに，全ての辺の移動時間が 0 の場合に対する多項式時間アルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-08-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2018-AL-169"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":191040,"links":{}}