{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:49Z","timestamp":1750220389492,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T00:00:00Z","timestamp":1625616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"South Australian Government","award":["Research Consortium Unlocking Complex Resources through Lean Processing"],"award-info":[{"award-number":["Research Consortium Unlocking Complex Resources through Lean Processing"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,7]]},"DOI":"10.1145\/3449726.3461433","type":"proceedings-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T14:51:34Z","timestamp":1625755894000},"page":"918-940","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary submodular optimisation"],"prefix":"10.1145","author":[{"given":"Aneta","family":"Neumann","sequence":"first","affiliation":[{"name":"The University of Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Qian","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"e_1_3_2_1_2_1","volume-title":"Mathematical Programming","author":"Nemhauser L. A.","year":"1978","unstructured":"G. L. Nemhauser , L. A. Wolsey and M. L. Fisher . An analysis of approximations for maximizing submodular set functions - I . Mathematical Programming , 1978 , 14(1): 265--294. G. L. Nemhauser, L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, 1978, 14(1): 265--294."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536459"},{"key":"e_1_3_2_1_4_1","volume-title":"Neumann: Maximizing Submodular functions under matroid vonstraints by evolutionary algorithms. Evolutionary Computation 23(4)","author":"Friedrich F.","year":"2015","unstructured":"T. Friedrich , F. Neumann: Maximizing Submodular functions under matroid vonstraints by evolutionary algorithms. Evolutionary Computation 23(4) , MIT Press , 543--558, 2015 . T. Friedrich, F. Neumann: Maximizing Submodular functions under matroid vonstraints by evolutionary algorithms. Evolutionary Computation 23(4), MIT Press, 543--558, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_6_1","volume-title":"Greed is good: Algorithmic results for sparse approximation","author":"Tropp","year":"2004","unstructured":"J. A. Tropp . Greed is good: Algorithmic results for sparse approximation . IEEE Transactions on Information Theory , 2004 , 50(10): 2231--2242. J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 2004, 50(10): 2231--2242."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374384"},{"key":"e_1_3_2_1_8_1","volume-title":"Journal of Machine Learning Research","author":"Krause A.","year":"2008","unstructured":"A. Krause , A. Singh and C. Guestrin . Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies . Journal of Machine Learning Research , 2008 , 9: 235--284. A. Krause, A. Singh and C. Guestrin. Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 2008, 9: 235--284."},{"key":"e_1_3_2_1_9_1","first-page":"1057","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML'11)","author":"Das D.","year":"2011","unstructured":"A. Das and D. Kempe . Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection . In: Proceedings of the 28th International Conference on Machine Learning (ICML'11) , pp. 1057 -- 1064 , Bellevue, WA , 2011 . A. Das and D. Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th International Conference on Machine Learning (ICML'11), pp. 1057--1064, Bellevue, WA, 2011."},{"key":"e_1_3_2_1_10_1","first-page":"1765","volume-title":"Advances in Neural Information Processing Systems 28 (NIPS'15)","author":"Qian Y.","year":"2015","unstructured":"C. Qian , Y. Yu and Z.-H. Zhou . Subset selection by Pareto optimization . In: Advances in Neural Information Processing Systems 28 (NIPS'15) , pp. 1765 -- 1773 , Montreal , Canada , 2015 . C. Qian, Y. Yu and Z.-H. Zhou. Subset selection by Pareto optimization. In: Advances in Neural Information Processing Systems 28 (NIPS'15), pp.1765--1773, Montreal, Canada, 2015."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3015812.3015933"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/364"},{"key":"e_1_3_2_1_13_1","first-page":"498","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML'17)","author":"Bian J. M.","year":"2017","unstructured":"A. A. Bian , J. M. Buhmann , A. Krause and S. Tschiatschek . Guarantees for greedy maximization of non-submodular functions with applications . In: Proceedings of the 34th International Conference on Machine Learning (ICML'17) , pp. 498 -- 507 , Sydney, Australia , 2017 . A. A. Bian, J. M. Buhmann, A. Krause and S. Tschiatschek. Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th International Conference on Machine Learning (ICML'17), pp. 498--507, Sydney, Australia, 2017."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1679"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304625"},{"key":"e_1_3_2_1_16_1","volume-title":"Artificial Intelligence","author":"Qian Y.","year":"2019","unstructured":"C. Qian , Y. Yu , K. Tang , X. Yao and Z.-H. Zhou . Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms . Artificial Intelligence , 2019 , 275: 279--294. C. Qian, Y. Yu, K. Tang, X. Yao and Z.-H. Zhou. Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. Artificial Intelligence, 2019, 275: 279--294."},{"key":"e_1_3_2_1_17_1","first-page":"2634","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML'19)","author":"Harshaw M.","year":"2019","unstructured":"C. Harshaw , M. Feldman , J. Ward and A. Karbasi . Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications . In: Proceedings of the 36th International Conference on Machine Learning (ICML'19) , pp. 2634 -- 2643 , Long Beach, CA , 2019 . C. Harshaw, M. Feldman, J. Ward and A. Karbasi. Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning (ICML'19), pp. 2634--2643, Long Beach, CA, 2019."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5726"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304625"},{"key":"e_1_3_2_1_20_1","volume-title":"Artificial Intelligence","author":"Qian Y.","year":"2019","unstructured":"C. Qian , Y. Yu , K. Tang , X. Yao and Z.-H. Zhou . Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms . Artificial Intelligence , 2019 , 275: 279--294. C. Qian, Y. Yu, K. Tang, X. Yao and Z.-H. Zhou. Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. Artificial Intelligence, 2019, 275: 279--294."},{"key":"e_1_3_2_1_21_1","first-page":"2634","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML'19)","author":"Harshaw M.","year":"2019","unstructured":"C. Harshaw , M. Feldman , J. Ward and A. Karbasi . Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications . In: Proceedings of the 36th International Conference on Machine Learning (ICML'19) , pp. 2634 -- 2643 , Long Beach, CA , 2019 . C. Harshaw, M. Feldman, J. Ward and A. Karbasi. Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning (ICML'19), pp. 2634--2643, Long Beach, CA, 2019."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5726"},{"key":"e_1_3_2_1_23_1","first-page":"2354","volume-title":"The Thirty-Third AAAI Conference on Artificial Intelligence","author":"Roostapour V.","year":"2019","unstructured":"Roostapour , V. , Neumann , A. , Neumann , K , and Friedrich , T . 2019. Pareto optimization for subset selection with dynamic cost constraints . The Thirty-Third AAAI Conference on Artificial Intelligence 2019 , pp. 2354 -- 2361 . AAAI Press. Roostapour, V., Neumann, A., Neumann, K, and Friedrich, T. 2019. Pareto optimization for subset selection with dynamic cost constraints. The Thirty-Third AAAI Conference on Artificial Intelligence 2019, pp. 2354--2361. AAAI Press."},{"key":"e_1_3_2_1_24_1","first-page":"47","volume-title":"-L","author":"Albert R.","year":"2002","unstructured":"Albert , R. , and Barab\u00e1si , A . -L . 2002 . Statistical mechanics of complex networks. Reviews of modern physics, pp. 74(1): 47 . Albert, R., and Barab\u00e1si, A.-L. 2002. Statistical mechanics of complex networks. Reviews of modern physics, pp. 74(1):47."},{"key":"e_1_3_2_1_25_1","first-page":"81","volume-title":"IEEE Conference on Data Mining","author":"Barbieri N.","unstructured":"Barbieri , N. , Bonchi , F. , and Manco , G . 2012. Topic-aware social influence propagation models . In IEEE Conference on Data Mining , pp. 81 -- 90 . IEEE Computer Society. Barbieri, N., Bonchi, F., and Manco, G. 2012. Topic-aware social influence propagation models. In IEEE Conference on Data Mining, pp. 81--90. IEEE Computer Society."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds5"},{"key":"e_1_3_2_1_27_1","first-page":"105","volume-title":"Theory of Computing","author":"Kempe D.","unstructured":"Kempe , D. , Kleinberg , J. M. , and Tardos , E . 2015. Maximizing the spread of influence through a social network . Theory of Computing , pp. 11: 105 -- 147 . Kempe, D., Kleinberg, J. M., and Tardos, E. 2015. Maximizing the spread of influence through a social network. Theory of Computing, pp. 11:105--147."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1017\/CBO9781139177801.004","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Krause A.","year":"2014","unstructured":"Krause , A. , and Golovin , D . 2014 . Submodular function maximization. In Bordeaux, L.; Hamadi, Y.; and Kohli, P. , eds., Tractability: Practical Approaches to Hard Problems . Cambridge University Press , pp. 71 -- 104 . Krause, A., and Golovin, D. 2014. Submodular function maximization. In Bordeaux, L.; Hamadi, Y.; and Kohli, P., eds., Tractability: Practical Approaches to Hard Problems. Cambridge University Press, pp. 71--104."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0463"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"e_1_3_2_1_32_1","first-page":"177","article-title":"Des valeurs moyennes","volume":"12","author":"Chebyshev P.","year":"1867","unstructured":"Chebyshev , P. 1867 . Des valeurs moyennes . Liouville's J Math Pure Appl 12 : 177 -- 184 . Chebyshev, P. 1867. Des valeurs moyennes. Liouville's J Math Pure Appl 12:177--184.","journal-title":"Liouville's J Math Pure Appl"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_36_1","first-page":"404","volume-title":"PPSN","author":"Neumann A.","year":"2020","unstructured":"Neumann , A. and Neumann , F . 2020. Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference , PPSN 2020 . Lecture Notes in Computer Science , pp. 404 -- 417 . Springer. Neumann, A. and Neumann, F. 2020. Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020. Lecture Notes in Computer Science, pp. 404--417. Springer."},{"volume-title":"Randomized algorithms","author":"Motwani R.","key":"e_1_3_2_1_37_1","unstructured":"Motwani , R. , Raghavan , P. 1995. Randomized algorithms . Cambridge University Press . Motwani, R., Raghavan, P. 1995. Randomized algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_38_1","series-title":"Natural Computing Series","volume-title":"Theory of Evolutionary Computation - Recent developments in discrete optimization","author":"Doerr B.","unstructured":"Doerr , B. , Neumann , F. 2020. Theory of Evolutionary Computation - Recent developments in discrete optimization . Natural Computing Series , Springer . Doerr, B., Neumann, F. 2020. Theory of Evolutionary Computation - Recent developments in discrete optimization. Natural Computing Series, Springer."},{"key":"e_1_3_2_1_39_1","first-page":"307","volume-title":"The 24th European Conference on Artificial Intelligence, ECAI 2020","author":"Assimi H.","year":"2020","unstructured":"Assimi , H. , Harper , O. , Xie , Y , Neumann , A. , Neumann , F. 2020 . Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives . The 24th European Conference on Artificial Intelligence, ECAI 2020 , pp. 307 -- 314 . IOS Press. Assimi, H., Harper, O., Xie, Y, Neumann, A., Neumann, F. 2020. Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. The 24th European Conference on Artificial Intelligence, ECAI 2020, pp. 307--314. IOS Press."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/s0020-0190(99)00031-9"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3461433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449726.3461433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:34Z","timestamp":1750191514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3461433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,7]]},"references-count":45,"alternative-id":["10.1145\/3449726.3461433","10.1145\/3449726"],"URL":"https:\/\/doi.org\/10.1145\/3449726.3461433","relation":{},"subject":[],"published":{"date-parts":[[2021,7,7]]},"assertion":[{"value":"2021-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}