{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:10:47Z","timestamp":1773943847947,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1109\/tac.2022.3226713","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T22:22:54Z","timestamp":1670278974000},"page":"5522-5535","source":"Crossref","is-referenced-by-count":6,"title":["Submodular Maximization With Limited Function Access"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9509-8922","authenticated-orcid":false,"given":"Andrew","family":"Downie","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1495-3489","authenticated-orcid":false,"given":"Bahman","family":"Gharesifard","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8636-407X","authenticated-orcid":false,"given":"Stephen L.","family":"Smith","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264258"},{"key":"ref35","first-page":"1","article-title":"Distributed submodular maximization","volume":"17","author":"mirzasoleiman","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.08.006"},{"key":"ref34","first-page":"316","article-title":"Scaling submodular maximization via pruned submodularity graphs","volume":"54","author":"zhou","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2980924"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431678"},{"key":"ref36","first-page":"3311","article-title":"Submodular streaming in all its glory: Tight approximation, minimum memory and low adaptive complexity","author":"kazemi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147476"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304154"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(516)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9486"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619396"},{"key":"ref32","first-page":"1","article-title":"Revisiting the greedy approach to submodular set function maximization","author":"goundan","year":"2007","journal-title":"Optim Online"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2882489"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2017.2691320"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref39","first-page":"235","article-title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","volume":"9","author":"krause","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref38","first-page":"1494","article-title":"Fast multi-stage submodular maximization","author":"wei","year":"0","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref19","first-page":"2436","article-title":"Submodular optimization with submodular cover and submodular knapsack constraints","author":"iyer","year":"0","journal-title":"Proc Int Conf Neural Inf Process Syst - Volume 2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9778-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.08.022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2881296"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263688"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3061656"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2740625"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2018.2889005"},{"key":"ref8","first-page":"1330","article-title":"On greedy maximization of entropy","author":"sharma","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref7","first-page":"3241","article-title":"Probabilistic submodular maximization in sub-linear time","author":"stan","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1989734.1989736"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.569"},{"key":"ref6","first-page":"912","article-title":"Multi-document summarization via budgeted maximization of submodular functions","author":"lin","year":"0","journal-title":"Proc Hum Lang Technol Conf North Amer Chapter Assoc Comput Linguistics"},{"key":"ref5","first-page":"1954","article-title":"Submodularity in data subset selection and active learning","volume":"37","author":"wei","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref40","article-title":"TLC Trip Record Data","year":"2020"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10233941\/09969880.pdf?arnumber=9969880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T18:16:57Z","timestamp":1695061017000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9969880\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":40,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3226713","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}