{"updated":"2025-01-19T10:37:06.480660+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231869","sets":["1164:2592:11452:11453"]},"path":["11453"],"owner":"44499","recid":"231869","title":["Shortest Path Reconfiguration with Relaxed Constraints"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-01-13"},"_buckets":{"deposit":"6f9e8731-e412-4e6f-a956-2cbff79928af"},"_deposit":{"id":"231869","pid":{"type":"depid","value":"231869","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Shortest Path Reconfiguration with Relaxed Constraints","author_link":["627112","627111","627113","627109","627115","627108","627114","627110"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Shortest Path Reconfiguration with Relaxed Constraints"},{"subitem_title":"Shortest Path Reconfiguration with Relaxed Constraints","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-01-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/231869/files/IPSJ-AL24196006.pdf","label":"IPSJ-AL24196006.pdf"},"date":[{"dateType":"Available","dateValue":"2026-01-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24196006.pdf","filesize":[{"value":"939.1 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":"d2d58946-0e5f-4f8d-97e5-d64902142d51","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoki, Domon"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Akira, Suzuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuma, Tamura"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Xiao, Zhou"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoki, Domon","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Akira, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuma, Tamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Xiao, Zhou","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_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":"The shortest path problem is the most classical and fundamental problem in the field of graph algorithm. Recently, its reconfiguration variant, namely the Shortest Path Reconfiguration problem, has received a lot of attention. In this paper, we study the complexity of k-SPR, which generalizes the Shortest Path Reconfiguration problem, with respect to k. In k-SPR, we are allowed to replace at most k consecutive vertices of the current shortest path at a time. We first show that, for any fixed rational numbers c and ε such that c > 0 and 0 < ε ≦ 1, k-SPR with k = cn1-ε is polynomially solvable if ε = 1 and c < 1; otherwise, PSPACE-complete. This intractability holds even when given graphs are restricted to bipartite graphs and r-th power graphs, where r is any positive integer. Furthermore, when we restrict 0 < ε < 1, the PSPACE-completeness holds for graphs with maximum degree 3. Then, we design an FPT algorithm parameterized by μ = n/2 - k ≧ 0 that runs in O(m + 6.730μμ4n) time. Finally, we show that, for any k, k-SPR can be solved in linear time for K2,3-minor-free graphs.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The shortest path problem is the most classical and fundamental problem in the field of graph algorithm. Recently, its reconfiguration variant, namely the Shortest Path Reconfiguration problem, has received a lot of attention. In this paper, we study the complexity of k-SPR, which generalizes the Shortest Path Reconfiguration problem, with respect to k. In k-SPR, we are allowed to replace at most k consecutive vertices of the current shortest path at a time. We first show that, for any fixed rational numbers c and ε such that c > 0 and 0 < ε ≦ 1, k-SPR with k = cn1-ε is polynomially solvable if ε = 1 and c < 1; otherwise, PSPACE-complete. This intractability holds even when given graphs are restricted to bipartite graphs and r-th power graphs, where r is any positive integer. Furthermore, when we restrict 0 < ε < 1, the PSPACE-completeness holds for graphs with maximum degree 3. Then, we design an FPT algorithm parameterized by μ = n/2 - k ≧ 0 that runs in O(m + 6.730μμ4n) time. Finally, we show that, for any k, k-SPR can be solved in linear time for K2,3-minor-free graphs.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-01-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2024-AL-196"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231869,"created":"2025-01-19T01:32:25.404009+00:00"}