{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T05:05:47Z","timestamp":1735448747511,"version":"3.32.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,7]]},"DOI":"10.1109\/apccas62602.2024.10808676","type":"proceedings-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T19:09:25Z","timestamp":1735326565000},"page":"707-711","source":"Crossref","is-referenced-by-count":0,"title":["An improved method for a set-pair routing problem by SAT"],"prefix":"10.1109","author":[{"given":"Koki","family":"Nagakura","sequence":"first","affiliation":[{"name":"Tokyo Univercity of Agriculture and Technology,Department of Electrical and Electronic Engineering,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiro","family":"Fujiyoshi","sequence":"additional","affiliation":[{"name":"Tokyo Univercity of Agriculture and Technology,Department of Electrical and Electronic Engineering,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"23","article-title":"On set pair routing problem","volume-title":"IEICE Technical Report, VLD2011-111","author":"Takahashi","year":"2011"},{"key":"ref2","first-page":"23","article-title":"An Enhancement of Length Difference Reduction Algorithm for Set Pair Routing","volume-title":"IEICE Technical Report, VLD2013-142","author":"Yamamoto","year":"2014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2565"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2019KEP0015"},{"key":"ref5","first-page":"7","article-title":"A Pin-Pair Routing Method for Length Difference Reduction in Set-Pair Routing Routing","volume-title":"IEICE Technical Report, VLD2019-95","author":"Wada","year":"2020"},{"key":"ref6","first-page":"241","article-title":"Max Length and Length Difference Minimization for Set Pair Routing Problem with ILP","volume-title":"IEICE Technical Report, VLD2017-60","author":"Hara","year":"2017"},{"key":"ref7","article-title":"Numberlink-nikoli"},{"issue":"17","key":"ref8","article-title":"On evaluation of encoding scheme of propsitional formula for number-link problem","volume-title":"IPSJ SIG Technical Report","volume":"2015-SLDM-173","author":"Matsunaga","year":"2015"},{"key":"ref9","first-page":"13","article-title":"A Routing Method by SAT for Set-Pair Routing Problem","volume-title":"IEICE Technical Report, VLD2022-21","author":"Nagakura","year":"2022"},{"key":"ref10","first-page":"41","article-title":"An Efficient Algorithm for Finding Maximum Flow in a Network-Flow","volume":"19","author":"Faruque","year":"2014","journal-title":"Journal of Physical Sciences"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.33.157"},{"issue":"1","key":"ref12","first-page":"57","article-title":"Foundations of SAT Solvers","volume":"25","author":"Inoue","year":"2010","journal-title":"Journal of JSAI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0183-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66263-3_9"},{"key":"ref15","article-title":"NetworkX-NetworkX documentation"},{"key":"ref16","first-page":"28","article-title":"Fast Method of Integer Linear Programming for SetPair Routing Problem\u2019","volume-title":"IEICE Technical Report, VLD2023-6","author":"Takashima","year":"2023"}],"event":{"name":"2024 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)","start":{"date-parts":[[2024,11,7]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2024,11,9]]}},"container-title":["2024 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10808178\/10808208\/10808676.pdf?arnumber=10808676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T06:27:14Z","timestamp":1735367234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10808676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/apccas62602.2024.10808676","relation":{},"subject":[],"published":{"date-parts":[[2024,11,7]]}}}