{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:26:40Z","timestamp":1773840400597,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1422658"],"award-info":[{"award-number":["CCF-1422658"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10626-019-00308-7","type":"journal-article","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T01:02:15Z","timestamp":1581901335000},"page":"381-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Submodular optimization problems and greedy strategies: A survey"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5467-5976","authenticated-orcid":false,"given":"Yajing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin K. P.","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pezeshki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"308_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed S, Atamt\u00fcrk A (2011) Maximizing a class of submodular utility functions. Math Program 128:149\u2013169","journal-title":"Math Program"},{"key":"308_CR2","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1115\/1.2766722","volume":"129","author":"G Arslan","year":"2007","unstructured":"Arslan G, Marden JR, Shamma JS (2007) Autonomous vehicle-target assignment: A game-theoretical formulation. J Dyn Syst Meas Control 129:584\u2013596","journal-title":"J Dyn Syst Meas Control"},{"key":"308_CR3","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Mirzasoleiman B, Karbasi A, Krause A (2014) Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"308_CR4","first-page":"22","volume":"47","author":"FM Bator","year":"1957","unstructured":"Bator FM (1957) The simple analytics of welfare maximization. Am Econ Rev 47:22\u201359","journal-title":"Am Econ Rev"},{"key":"308_CR5","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"2005","unstructured":"Bertsekas DP (2005) Dynamic programming and optimal control, 3rd edn. Athena Scientific, Belmont","edition":"3"},{"key":"308_CR6","unstructured":"Bian AA, Buhmann JM, Krause A, Tschiatschek S (2017) Guarantee for greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th international conference on machine learning, pp 498\u2013507"},{"key":"308_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(02)00455-9","volume":"131","author":"E Boros","year":"2003","unstructured":"Boros E, Elbassioni K, Khachiyan L (2003) An inequality for polymatroid functions and its applications. Discrete Appl Math 131:255\u2013281","journal-title":"Discrete Appl Math"},{"key":"308_CR8","first-page":"255","volume":"44","author":"N Buchbinder","year":"2012","unstructured":"Buchbinder N, Feldman M, Naor J, Schwartz R (2012) A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM J Comput 44:255\u2013281","journal-title":"SIAM J Comput"},{"key":"308_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Feldman M, Naor J, Schwartz R (2014) Submodular maximization with cardinality constraints. In: Proceedings of the 25th annual ACM-SIAM symposium on Discrete Algorithms, pp 1433\u20131452","DOI":"10.1137\/1.9781611973402.106"},{"key":"308_CR10","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu G, Chekuri C, P\u00e1l M, Vondr\u00e1k J (2011) Maximizing a submodular set function subject to a matroid constraint. SIAM J Comput 40:1740\u20131766","journal-title":"SIAM J Comput"},{"key":"308_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church R, Velle CR (1974) The maximal covering location problem. Pap Reg Sci 32:101\u2013118","journal-title":"Pap Reg Sci"},{"key":"308_CR12","doi-asserted-by":"crossref","unstructured":"Clark A, Poovendran R (2011) A submodular optimization framework for leader selection in linear multi-agent systems. In: Proceedings of the 50th IEEE conference on control and decision and european control conference, pp 3614\u20133621","DOI":"10.1109\/CDC.2011.6160248"},{"key":"308_CR13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen R, Katzir L, Raz D (2006) An efficient approximation for the generalized assignment problem. Inf Process Lett 100:162\u2013166","journal-title":"Inf Process Lett"},{"key":"308_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti M, Cornu\u00e9jols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Appl Math 7:251\u2013274","journal-title":"Discrete Appl Math"},{"key":"308_CR15","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornu\u00e9jols","year":"1977","unstructured":"Cornu\u00e9jols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag Sci 23:789\u2013810","journal-title":"Manag Sci"},{"key":"308_CR16","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"WH Cunningham","year":"1986","unstructured":"Cunningham WH (1986) Improved bounds for matroid partition and intersection algorithms. SIAM J Comput 15:948\u2013957","journal-title":"SIAM J Comput"},{"key":"308_CR17","unstructured":"Edmonds J (1966) Matroids and the greedy algorithm. In: Proceedings of the international symposium on mathematical programming, pp 93\u2013117"},{"key":"308_CR18","unstructured":"Edmonds J (1970) Submodular functions, matroids, and certain polyhedra. Combin Struct Appl 69\u201387"},{"key":"308_CR19","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds J, Fulkerson DR (1965) Transversals and matroid partition. J Res Nat Bur Stand 69B:147\u2013153","journal-title":"J Res Nat Bur Stand"},{"key":"308_CR20","doi-asserted-by":"crossref","unstructured":"Feldman M, Naor J, Schwartz R (2011) A unified continuous greedy algorithm for submodular maximization. In: Proceedings of the 52nd IEEE annual symposium on foundations of computer science, pp 570\u2013579","DOI":"10.1109\/FOCS.2011.46"},{"key":"308_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"ML Fisher","year":"1978","unstructured":"Fisher ML, Nemhauser GL, Wolsey LA (1978) An analysis of approximations for maximizing submodular set functions\u2013II. Math Prog Study 8:73\u201387","journal-title":"Math Prog Study"},{"key":"308_CR22","doi-asserted-by":"crossref","unstructured":"Fleischer L, Goemans MX, Mirrokni VS, Sviridenko M (2006) Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the 17th annual ACM-siam symposium on discrete algorithm, pp 611\u2013620","DOI":"10.1145\/1109557.1109624"},{"key":"308_CR23","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115\u20131145","journal-title":"J ACM"},{"key":"308_CR24","first-page":"427","volume":"42","author":"D Golovin","year":"2001","unstructured":"Golovin D, Krause A (2001) Adaptive submodularity: theory and applications in active learning and stochastic optimization. J Artif Intell Res 42:427\u2013486","journal-title":"J Artif Intell Res"},{"key":"308_CR25","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0120891","volume":"12","author":"D Hausmann","year":"1980","unstructured":"Hausmann D, Korte B, Jenkyns TA (1980) Worst case analysis of greedy type algorithms for independence systems. Math Program Stud 12:120\u2013131","journal-title":"Math Program Stud"},{"key":"308_CR26","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1109\/JSAC.2007.070602","volume":"25","author":"J He","year":"2007","unstructured":"He J, Bresler M, Chiang M, Rexford J (2007) Towards robust multi-layer traffic engineering: Optimization of congestion control and routing. IEEE J Sel Area Comm 25:868\u2013880","journal-title":"IEEE J Sel Area Comm"},{"key":"308_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/TSMC.1975.5409158","volume":"SMC-5","author":"RA Jarvis","year":"1975","unstructured":"Jarvis RA (1975) Optimization strategies in adaptive control: A selective survey. IEEE Trans Syst Man Cybern SMC-5:83\u201394","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"308_CR28","doi-asserted-by":"crossref","unstructured":"Kapralov M, Post I, Vondr\u00e1k J (2013) Online submodular welfare maximization: Greedy is optimal. In: Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, pp 1216\u20131225","DOI":"10.1137\/1.9781611973105.88"},{"key":"308_CR29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf Process Lett 70:39\u201345","journal-title":"Inf Process Lett"},{"key":"308_CR30","unstructured":"Knuth DE (1973) Matroid partitioning. Technical Report, STAN-CS-73-342, Stanford University"},{"key":"308_CR31","doi-asserted-by":"crossref","unstructured":"Korula N, Mirrokni VS, Zadimoghaddam M (2015) Online submodular welfare maximization: greedy beats 1\/2 in random order. In: Proceedings of the 47th annual symposium on theory of computing, pp 889\u2013898","DOI":"10.1145\/2746539.2746626"},{"key":"308_CR32","first-page":"19","volume":"3","author":"A Krause","year":"2012","unstructured":"Krause A, Golovin D (2012) Submodular function maximization. Tractability: Practical Approaches to Hard Problems 3:19","journal-title":"Tractability: Practical Approaches to Hard Problems"},{"key":"308_CR33","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause A, Singh A, Guestrin C (2008) Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J Mach Learn Res 9:235\u2013284","journal-title":"J Mach Learn Res"},{"key":"308_CR34","doi-asserted-by":"crossref","unstructured":"Kulik A, Shachnai H, Tamir T (2009) Maximizing submodular set functions subject to multiple linear constraints. In: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, pp 545\u2013554","DOI":"10.1137\/1.9781611973068.60"},{"key":"308_CR35","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/90.993307","volume":"10","author":"RJ La","year":"2002","unstructured":"La RJ, Anantharam V (2002) Utility-based rate control in the internet for elastic traffic. IEEE\/ACM Trans Netw 10:272\u2013286","journal-title":"IEEE\/ACM Trans Netw"},{"key":"308_CR36","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.dsp.2009.04.004","volume":"19","author":"Y Li","year":"2009","unstructured":"Li Y, Krakow LW, Chong EKP, Groom KN (2009) Groom approximate stochastic dynamic programming for sensor scheduling to track multiple targets. Digit Signal Process 19:533\u2013545","journal-title":"Digit Signal Process"},{"key":"308_CR37","unstructured":"Lin H, Bilmes J (2011) A class of submodular functions for document summarization. In: Proceedings of the 49th annual meeting of the association for computational linguistics: Human language technologies, pp 510\u2013520"},{"key":"308_CR38","unstructured":"Littman ML (1996) Algorithms for sequential decision making. Technical Report, CS\u201396\u201309"},{"key":"308_CR39","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1109\/TIT.2014.2308258","volume":"60","author":"E Liu","year":"2014","unstructured":"Liu E, Chong EKP, Scharf LL (2014) Greedy adaptive linear compression in signal-plus-noise models. IEEE Trans Inf Theory 60:2269\u20132280","journal-title":"IEEE Trans Inf Theory"},{"key":"308_CR40","doi-asserted-by":"crossref","unstructured":"Liu Y, Chong EKP, Pezeshki A (2015) Bounding the greedy strategy in finite-horizon string optimization. In: Proceedings of the 54th IEEE conference on decision and control, pp 3900\u20133905","DOI":"10.1109\/CDC.2015.7402826"},{"key":"308_CR41","doi-asserted-by":"crossref","unstructured":"Liu Y, Chong EKP, Pezeshki A (2018a) Extending polymatroid set functions with curvature and bounding the greedy strategy. In: 2018 IEEE statistical signal processing workshop, pp 318\u2013322","DOI":"10.1109\/SSP.2018.8450732"},{"key":"308_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/23307706.2017.1393355","volume":"5","author":"Y Liu","year":"2018","unstructured":"Liu Y, Chong EKP, Pezeshki A (2018b) Performance bounds for Nash equilibria in submodular utility systems with user groups. J Control Decision 5:1\u201318","journal-title":"J Control Decision"},{"key":"308_CR43","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1007\/s10878-018-0345-z","volume":"37","author":"Y Liu","year":"2019","unstructured":"Liu Y, Chong EKP, Pezeshki A (2019) Improved bounds for the greedy strategy in optimization problems with curvature. J Comb Optim 37:1126\u20131149","journal-title":"J Comb Optim"},{"key":"308_CR44","doi-asserted-by":"crossref","unstructured":"Liu Y, Zhang Z, Chong EKP, Pezeshki A (2018c) Performance bounds for the k-batch greedy strategy in optimization problems with curvature. In: Proceedings of 2016 American control conference, pp 7177\u20137182","DOI":"10.1109\/ACC.2016.7526805"},{"key":"308_CR45","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s10957-017-1177-1","volume":"177","author":"Y Liu","year":"2018","unstructured":"Liu Y, Zhang Z, Chong EKP, Pezeshki A (2018d) Performance bounds with curvature for batched greedy optimization. J Optim Theory Appl 177:535\u2013562","journal-title":"J Optim Theory Appl"},{"key":"308_CR46","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L (1983) Submodular functions and convexity. Math Program, 235\u2013257","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"308_CR47","unstructured":"Mirzasoleiman B, Karbasi A, Krause A (2017) Deletion-robust submodular maximization: data summarization with \u201cthe right to be forgotten\u201d. In: Proceedings of the 34th international conference on machine learning, vol 70, pp 2449\u20132458"},{"issue":"238","key":"308_CR48","first-page":"1","volume":"17","author":"B Mirzasoleiman","year":"2016","unstructured":"Mirzasoleiman B, Karbasi A, Sarkar A, Krause A (2016) Distributed submodular maximization. J Mach Learn Res 17(238):1\u201344","journal-title":"J Mach Learn Res"},{"key":"308_CR49","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J (1951) Non-cooperative games. Ann Math 54:286\u2013295","journal-title":"Ann Math"},{"key":"308_CR50","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"RM Nauss","year":"2003","unstructured":"Nauss RM (2003) Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J Comput 15:249\u2013266","journal-title":"INFORMS J Comput"},{"key":"308_CR51","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2013I. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"308_CR52","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04101-3","volume-title":"Understanding cryptography: a textbook for students and practitioners","author":"C Paar","year":"2010","unstructured":"Paar C, Pelzl J (2010) Understanding cryptography: a textbook for students and practitioners. Springer, Berlin"},{"key":"308_CR53","doi-asserted-by":"crossref","first-page":"2254","DOI":"10.1109\/TAC.2007.910665","volume":"52","author":"DP Palomar","year":"2007","unstructured":"Palomar DP, Chiang M (2007) Alternative distributed algorithms for network utility maximization: Framework and applications. IEEE Trans Autom Control 52:2254\u20132269","journal-title":"IEEE Trans Autom Control"},{"key":"308_CR54","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate dynamic programming: Solving the curses of dimensionality","author":"WB Powell","year":"2007","unstructured":"Powell WB (2007) Approximate dynamic programming: Solving the curses of dimensionality. Wiley, New York"},{"key":"308_CR55","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ifacol.2015.10.340","volume":"48","author":"G Qu","year":"2015","unstructured":"Qu G, Brown D, Li N (2015) Distributed greedy algorithm for satellite assignment problem with submodular utility function. IFAC-PapersOnLine 48:258\u2013263","journal-title":"IFAC-PapersOnLine"},{"key":"308_CR56","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.3987","volume":"48","author":"DM Roijers","year":"2013","unstructured":"Roijers DM, Vamplew P, Whiteson S, Dazeley R (2013) A survey of multi-objective sequential decision-making. J Artif Intell Res 48:67\u2013113","journal-title":"J Artif Intell Res"},{"key":"308_CR57","doi-asserted-by":"crossref","unstructured":"Rowaihy H, Eswaran S, Johnson M, Verma D, Bar-Noy A, Brown T, Porta TL (2007) A survey of sensor selection schemes in wireless sensor networks. In: Proceedings of SPIE 6562, Unattended Ground, Sea, and Air Sensor Technologies and Applications","DOI":"10.1117\/12.723514"},{"key":"308_CR58","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23:555\u2013565","journal-title":"J ACM"},{"key":"308_CR59","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.compchemeng.2005.02.036","volume":"29","author":"M Schlegel","year":"2005","unstructured":"Schlegel M, Stockmann K, Binder T, Marquardt W (2005) Dynamic optimization using adaptive control vector parameterization. Comput Chem Eng 29:1731\u20131751","journal-title":"Comput Chem Eng"},{"key":"308_CR60","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys DB, Tardos \u00c9 (1993) An approximation algorithm for the generalized assignment problem. Math Program 62:461\u2013474","journal-title":"Math Program"},{"key":"308_CR61","unstructured":"Streeter M, Golovin D (2008) An online algorithm for maximizing submodular functions. In: Proceedings of advances in neural information processing systems, vol 21, pp 1577\u20131584"},{"key":"308_CR62","doi-asserted-by":"crossref","unstructured":"Sun X, Cassandras CG, Meng X (2017) A submodularity-based approach for multi-agent optimal coverage problem. In: Proceedings of the 56th IEEE conference on control and decision, pp 4082\u20134087","DOI":"10.1109\/CDC.2017.8264258"},{"issue":"1","key":"308_CR63","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343","journal-title":"Oper Res Lett"},{"key":"308_CR64","doi-asserted-by":"crossref","unstructured":"Tschiatschek S, Singla A, Krause A (2017) Selecting sequences of items via submodular maximization. In: Proceedings of the 31st AAAI conference on artificial intelligence, pp 2667\u20132673","DOI":"10.1609\/aaai.v31i1.10923"},{"key":"308_CR65","doi-asserted-by":"crossref","unstructured":"Vetta A (2002) Nash equilibrium in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd annual IEEE symposium on foundations of computer science, pp 416\u2013425","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"308_CR66","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k J (2008) Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the 40th annual ACM symposium on theory of computing, pp 67\u201374","DOI":"10.1145\/1374376.1374389"},{"key":"308_CR67","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10878-014-9707-3","volume":"31","author":"Z Wang","year":"2014","unstructured":"Wang Z, Moran B, Wang X, Pan Q (2014) Approximation for maximizing monotone non-decreasing set functions with a greedy method. J Comb Optim 31:29\u201343","journal-title":"J Comb Optim"},{"key":"308_CR68","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"LA Wolsey","year":"1982","unstructured":"Wolsey LA (1982) Maximising real-valued submodular functions: primal and dual heuristics for location problems. Math Oper Res 7:410\u2013425","journal-title":"Math Oper Res"},{"key":"308_CR69","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TAC.2015.2440566","volume":"61","author":"Z Zhang","year":"2016","unstructured":"Zhang Z, Chong EKP, Pezeshki A, Moran W (2016) String submodular functions with curvature constraints. IEEE Trans Autom Control 61:601\u2013616","journal-title":"IEEE Trans Autom Control"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-019-00308-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-019-00308-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-019-00308-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T18:23:40Z","timestamp":1665858220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-019-00308-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s10626-019-00308-7","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"5 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}