{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:44Z","timestamp":1772927804046,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025vlp0001","type":"journal-article","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T22:07:32Z","timestamp":1758492452000},"page":"590-595","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and Exact Solution of Set-Pair Routing Problem"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Yasuhiro","family":"TAKASHIMA","sequence":"first","affiliation":[{"name":"The Faculty of Environmental Engineering, the University of Kitakyushu"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Tutorials Point, \u201cGraph Theory - Network Routing,\u201d https:\/\/www.tutorialspoint.com\/graph_theory\/graph_theory_network_routing.htm"},{"key":"2","unstructured":"[2] D. Nagy, \u201cRouting with graphs,\u201d https:\/\/medium.com\/generative-design\/routing-with-graphs-5fb564b02a74"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] V. Betz and J. Rose, \u201cVPR: A new packing, placement and routing tool for FPGA research,\u201d Proc. International Conference on Field-Programmable Logic and Applications, 1997. 10.1007\/3-540-63465-7_226","DOI":"10.1007\/3-540-63465-7_226"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Kohira and A. Takahashi, \u201cCAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles,\u201d IEICE Trans. Fundamentals, vol.E93-A, no.12, pp.2380-2388, Dec. 2010. 10.1587\/transfun.e93.a.2380","DOI":"10.1587\/transfun.E93.A.2380"},{"key":"5","unstructured":"[5] A. Takahashi, \u201cOn set pair routing problem,\u201d IEICE Technical Report, vld2011-44, 2011 (in Japanese)."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. Sato, K. Akagi, and A. Takahashi, \u201cA fast length matching routing pattern generation method for set-pair routing problem using selective pin-pair connections,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.9, pp.1037-1044, Setp. 2020. 10.1587\/transfun.2019kep0015","DOI":"10.1587\/transfun.2019KEP0015"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Y. Nakatani and A. Takahashi, \u201cA length matching routing algorithm for set-pair routing problem,\u201d IEICE Trans. Fundamentals, vol.E98-A, no.12, pp.2565-2571, Dec. 2015. 10.1587\/transfun.e98.a.2565","DOI":"10.1587\/transfun.E98.A.2565"},{"key":"8","unstructured":"[8] K. Akagi, S. Sato, and A. Takahashi, \u201cTarget pin-pair selection algorithm using minimum maximum-edge-weight matching for set-pair routing,\u201d Proc. SASIMI 2018, pp.337-342, 2018."},{"key":"9","unstructured":"[9] S. Hara and K. Fujiyoshi, \u201cMax length and length difference minimization for set pair routing problem with ILP,\u201d IEICE Technical Report, vld2017-60, 2017 (in Japanese)."},{"key":"10","unstructured":"[10] K. Nagakura, R. Yokoya, and K. Fujiyoshi, \u201cA routing method by SAT for set-pair routing problem,\u201d IEICE Technical Report, vld2022-21, 2022."},{"key":"11","unstructured":"[11] Y. Takashima, \u201cFast method of integer linear programming for set-pair routing problem,\u201d IEICE Technical Report, vld2023-6, 2023."},{"key":"12","unstructured":"[12] Y. Takashima, \u201cFast integer linear programming for set-pair routing problem,\u201d Proc. SASIMI 2024, R1-11, 2024."},{"key":"13","unstructured":"[13] K. Nagakura and K. Fujiyoshi, \u201cAn improved routing method by SAT for Set-pair routing problem,\u201d IEICE Technical Report, vld2023-77, 2023."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] C.-L. Li, S.T. Mccormick, and D. Simchi-Levi, \u201cThe complexity of finding two disjoint paths with min-max objective function,\u201d Discrete Applied Mathematics, vol.26, no.1, pp.105-115, 1990. 10.1016\/0166-218x(90)90024-7","DOI":"10.1016\/0166-218X(90)90024-7"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025VLP0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:40Z","timestamp":1772856700000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025VLP0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025vlp0001","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025VLP0001"}}