{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T16:40:23Z","timestamp":1768581623481,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2221-E-008-074-MY3"],"award-info":[{"award-number":["108-2221-E-008-074-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["111-2221-E-008-097"],"award-info":[{"award-number":["111-2221-E-008-097"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/lra.2023.3243792","type":"journal-article","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T19:29:39Z","timestamp":1676057379000},"page":"1927-1934","source":"Crossref","is-referenced-by-count":6,"title":["Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity"],"prefix":"10.1109","volume":"8","author":[{"given":"Pao-Te","family":"Lin","sequence":"first","affiliation":[{"name":"Mathematics Department, National Central University, Taoyuan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7818-5821","authenticated-orcid":false,"given":"Kuo-Shih","family":"Tseng","sequence":"additional","affiliation":[{"name":"Mathematics Department, National Central University, Taoyuan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-021-01565-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-017-9616-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00161-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00175-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/364"},{"key":"ref13","first-page":"1125","article-title":"Learning fourier sparse set functions","author":"Stobbe","year":"2012","journal-title":"Proc. Artif. Intell. Statist."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574721001661"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3158227"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00101-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"ref19","article-title":"The traveling salesman problem: A comprehensive survey","author":"Zambito","year":"2006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9030031"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-015-9521-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-021-09982-9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139670"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918781001"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10049284\/10041936.pdf?arnumber=10041936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T14:44:50Z","timestamp":1707835490000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10041936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2023.3243792","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}