{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:17:23Z","timestamp":1730204243349,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/cdc.2013.6760699","type":"proceedings-article","created":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T22:14:07Z","timestamp":1394748847000},"page":"5156-5161","source":"Crossref","is-referenced-by-count":9,"title":["Near optimality of greedy strategies for string submodular functions with forward and backward curvature constraints"],"prefix":"10.1109","author":[{"family":"Zhenliang Zhang","sequence":"first","affiliation":[]},{"family":"Zengfu Wang","sequence":"additional","affiliation":[]},{"given":"Edwin K. P.","family":"Chong","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Pezeshki","sequence":"additional","affiliation":[]},{"given":"William","family":"Moran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109675"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/080735503"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993740"},{"key":"15","first-page":"649","article-title":"A tight linear time (1\/2)-approximation for unconstrained sub modular maximization","author":"buchbinder","year":"2012","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"journal-title":"Maximizing Sequence-submodular Functions and Its Application to Online Advertising","year":"2010","author":"alaei","key":"13"},{"key":"14","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"golovin","year":"2011","journal-title":"J of Artificial Intelligence Research"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9707-3"},{"key":"12","article-title":"An online algorithm for maximizing submodular functions","author":"streeter","year":"2008","journal-title":"Proc 22nd Conf Neural Inform Processing Systems"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a011"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.55"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.60"},{"key":"25","first-page":"323","article-title":"Nonmonotone submodular maximization under matroid and knapsack constraints","author":"lee","year":"2009","journal-title":"Proc ACM Symp Theory of Computing"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0463"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9965.1991.tb00002.x"},{"journal-title":"Dynamic Programming and Optimal Control","year":"2000","author":"bertsekas","key":"2"},{"key":"10","first-page":"253","article-title":"Submodularity and curvature: The optimal algorithm","volume":"23","author":"vondrak","year":"2010","journal-title":"RIMS Kokyuroku Bessatsu"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6427057"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717225"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.001"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-009-0071-x"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"8","first-page":"73","volume":"8","author":"fisher","year":"1978","journal-title":"An Analysis of Approximations for Maximizing Submodular Set Functions-II"}],"event":{"name":"2013 IEEE 52nd Annual Conference on Decision and Control (CDC)","start":{"date-parts":[[2013,12,10]]},"location":"Firenze","end":{"date-parts":[[2013,12,13]]}},"container-title":["52nd IEEE Conference on Decision and Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6749719\/6759837\/06760699.pdf?arnumber=6760699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T20:11:59Z","timestamp":1490299919000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6760699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/cdc.2013.6760699","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}