{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:09:04Z","timestamp":1771387744394,"version":"3.50.1"},"reference-count":6,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transinf.2017fcl0003","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T22:26:25Z","timestamp":1519943185000},"page":"611-612","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Mohd","family":"SHAHRIZAN OTHMAN","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"SHURBEVSKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"NAGAMOCHI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] F.V. Fomin, F. Grandoni, D. Kratsch, D. Lokshtanov, and S. Saurabh, \u201cComputing optimal Steiner trees in polynomial space,\u201d Algorithmica, vol.65, no.3, pp.584-604, 2013. 10.1007\/s00453-012-9612-z","DOI":"10.1007\/s00453-012-9612-z"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A. Garc\u00eda and J. Tejel, \u201cPolynomially solvable cases of the bipartite traveling salesman problem,\u201d European Journal of Operational Research, vol.257, no.2, pp.429-438, 2017. 10.1016\/j.ejor.2016.07.060","DOI":"10.1016\/j.ejor.2016.07.060"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Y. Gurevich, and S. Shelah, \u201cExpected computation time for Hamiltonian path problem,\u201d SIAM Journal on Computing, vol.16, no.3, pp.486-502, 1987. 10.1137\/0216034","DOI":"10.1137\/0216034"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Matou\u0161ek and J. Ne\u0161et\u0159il, \u201cInvitation to discrete mathematics,\u201d Oxford University Press, Chapter 2, pp.47-96, 1998.","DOI":"10.1093\/oso\/9780198502081.003.0008"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] A. Shurbevski, H. Nagamochi, and Y. Karuno, \u201cApproximating the Bipartite TSP and its biased generalization,\u201d Algorithms and Computation, vol.8344, pp.56-67, Springer, 2014. 10.1007\/978-3-319-04657-0_8","DOI":"10.1007\/978-3-319-04657-0_8"},{"key":"6","unstructured":"[6] J. Stirling, \u201cMethodus differentialis, sive tractatus de summation et interpolation serierum infinitarium,\u201d 1730, English Translation by Holliday, J., \u201cThe Differential Method: A Treatise of The Summation and Interpolation of Infinite Series,\u201d 1749."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017FCL0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T18:02:48Z","timestamp":1719856968000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017FCL0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017fcl0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}