{"type":"ScholarlyArticle","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","authors":[{"name":"Victoria G. Crawford","slug":"victoria-g-crawford","given":"Victoria G.","family":"Crawford","affiliation":"Department of Computer and Information Science and Engineering , University of Florida , United States"}],"abstract":"In this paper, the Minimum Cost Submodular Cover problem is studied, which is to minimize a modular cost function such that the monotone submodular benefit function is above a threshold. For this problem, an evolutionary algorithm EASC is introduced that achieves a constant, bicriteria approximation in expected polynomial time; this is the first polynomial-time evolutionary approximation algorithm for Minimum Cost Submodular Cover. To achieve this running time, ideas motivated by submodularity and monotonicity are incorporated into the evolutionary process, which likely will extend to other submodular optimization problems. In a practical application, EASC is demonstrated to outperform the greedy algorithm and converge faster than competing evolutionary algorithms for this problem.","doi":"10.24963/ijcai.2019/171","url":"https://ijcai.org/proceedings/2019/171","pdf":"https://ijcai.org/proceedings/2019/0171.pdf","markdown":"https://ijcai.org/proceedings/2019/171.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/171","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Heuristic Search and Game Playing","track":"Main track","number":171,"pages":{"first":1227,"last":1233},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Heuristic Search and Game Playing: Heuristic Search and Machine Learning"],"videos":[],"references":[{"position":1,"raw":"[Badanidiyuru and Vondrák, 2014] Ashwinkumar Badani- diyuru and Jan Vondrák. Fast algorithms for maximizing submodular functions. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1497-1514. SIAM, 2014.","title":"Ashwinkumar Badanidiyuru and Jan Vondrák. Fast algorithms for maximizing submodular functions","authors":"Vondrák Badanidiyuru","year":"2014","venue":"Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Borgs et al., 2014] Christian Borgs, Michael Brautbar, Jen- nifer Chayes, and Brendan Lucier. Maximizing social influ- ence in nearly optimal time. In Proceedings of the twenty- fifth annual ACM-SIAM symposium on Discrete algorithms, pages 946-957. SIAM, 2014.","title":"Maximizing social influence in nearly optimal time","authors":"Borgs","year":"2014","venue":"Proceedings of the twentyfifth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chen et al., 2010] Wei Chen, Chi Wang, and Yajun Wang. Scalable influence maximization for prevalent viral mar- keting in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowl- edge discovery and data mining, pages 1029-1038. ACM, 2010.","title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","authors":"Wei Chen, Chi Wang, Yajun Wang","year":"2010","venue":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Feige, 1998] Uriel Feige. A threshold of ln n for approximat- ing set cover. Journal of the ACM (JACM), 45(4):634-652, 1998.","title":"A threshold of ln n for approximating set cover","authors":"Uriel Feige","year":"1998","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Friedrich and Neumann, 2014] Tobias Friedrich and Frank Neumann. Maximizing submodular functions under ma- troid constraints by multi-objective evolutionary algorithms. In International Conference on Parallel Problem Solving from Nature, pages 922-931. Springer, 2014.","title":"Maximizing submodular functions under matroid constraints by multi-objective evolutionary algorithms","authors":"Neumann Friedrich, Tobias Friedrich, Frank Neumann","year":"2014","venue":"International Conference on Parallel Problem Solving from Nature","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Friedrich and Neumann, 2015] Tobias Friedrich and Frank Neumann. Maximizing submodular functions under ma- troid constraints by evolutionary algorithms. Evolutionary computation, 23(4):543-558, 2015.","title":"Maximizing submodular functions under matroid constraints by evolutionary algorithms","authors":"Neumann Friedrich, Tobias Friedrich, Frank Neumann","year":"2015","venue":"Evolutionary computation","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Friedrich et al., 2018] Tobias Friedrich, Andreas Göbel, Francesco Quinzan, and Markus Wagner. Heavy-tailed mutation operators in single-objective combinatorial opti- mization. In International Conference on Parallel Problem Solving from Nature, pages 134-145. Springer, 2018.","title":"Heavy-tailed mutation operators in single-objective combinatorial optimization","authors":"Friedrich","year":"2018","venue":"International Conference on Parallel Problem Solving from Nature","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Goyal et al., 2013] Amit Goyal, Francesco Bonchi, Laks VS Lakshmanan, and Suresh Venkatasubramanian. On mini- mizing budget and time in influence propagation over social networks. Social network analysis and mining, 3(2):179- 192, 2013.","title":"On minimizing budget and time in influence propagation over social networks","authors":"Amit Goyal, Francesco Bonchi, Laks Vs Lakshmanan, Suresh Venkatasubramanian","year":"2013","venue":"Social network analysis and mining","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Guillory and Bilmes, 2011] Andrew Guillory and Jeff A Bilmes. Simultaneous learning and covering with adversar- ial noise. In ICML, volume 11, pages 369-376, 2011.","title":"Simultaneous learning and covering with adversarial noise","authors":"Bilmes Guillory, Andrew Guillory, Jeff A Bilmes","year":"2011","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Horoba and Neumann, 2009] Christian Horoba and Frank Neumann. Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. In Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pages 79-86. ACM, 2009.","title":"Christian Horoba and Frank Neumann. Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms","authors":"Neumann Horoba","year":"2009","venue":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Iyer and Bilmes, 2013] Rishabh K Iyer and Jeff A Bilmes. Submodular optimization with submodular cover and sub- modular knapsack constraints. In Advances in Neural In- formation Processing Systems, pages 2436-2444, 2013.","title":"Submodular optimization with submodular cover and submodular knapsack constraints","authors":"K Rishabh, Jeff A Iyer, Bilmes","year":"2013","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kempe et al., 2003] David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137-146. ACM, 2003.","title":"Maximizing the spread of influence through a social network","authors":"David Kempe, Jon Kleinberg, Éva Tardos","year":"2003","venue":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kuhnle et al., 2017] Alan Kuhnle, Tianyi Pan, Md Abdul Alim, and My T Thai. Scalable bicriteria algorithms for the threshold activation problem in online social networks. In INFOCOM 2017-IEEE Conference on Computer Commu- nications, IEEE, pages 1-9. IEEE, 2017.","title":"Scalable bicriteria algorithms for the threshold activation problem in online social networks","authors":"Alan Kuhnle, Tianyi Pan, Md Abdul Alim, My T Thai","year":"2017","venue":"INFOCOM 2017-IEEE Conference on Computer Communications","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Laumanns et al., 2002] Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. Combining conver- gence and diversity in evolutionary multiobjective optimiza- tion. Evolutionary computation, 10(3):263-282, 2002.","title":"Combining convergence and diversity in evolutionary multiobjective optimization","authors":"Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Eckart Zitzler","year":"2002","venue":"Evolutionary computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Leskovec and Krevl, 2015] Jure Leskovec and Andrej Krevl. {SNAP Datasets}:{Stanford} large network dataset collec- tion. 2015.","title":"{SNAP Datasets}:{Stanford} large network dataset collection","authors":"Jure Leskovec, Andrej Krevl","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Mirzasoleiman et al., 2015] Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, and Andreas Krause. Distributed submodular cover: Succinctly summarizing massive data. In Advances in Neural Information Process- ing Systems, pages 2881-2889, 2015.","title":"Distributed submodular cover: Succinctly summarizing massive data","authors":"Mirzasoleiman","year":"2015","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Mirzasoleiman et al., 2016] Baharan Mirzasoleiman, Morteza Zadimoghaddam, and Amin Karbasi. Fast distributed submodular cover: Public-private data summa- rization. In Advances in Neural Information Processing Systems, pages 3594-3602, 2016.","title":"Fast distributed submodular cover: Public-private data summarization","authors":"Mirzasoleiman","year":"2016","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Norouzi-Fard et al., 2016] Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, and Volkan Cevher. An efficient streaming algorithm for the submodular cover problem. In Advances in Neural Information Processing Systems, pages 4493-4501, 2016.","title":"An efficient streaming algorithm for the submodular cover problem","authors":"Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, Volkan Cevher","year":"2016","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Qian et al., 2015a] Chao Qian, Yang Yu, and Zhi-Hua Zhou. On constrained boolean pareto optimization. In IJCAI, pages 389-395, 2015.","title":"On constrained boolean pareto optimization","authors":"Qian","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/61"},{"position":20,"raw":"[Qian et al., 2015b] Chao Qian, Yang Yu, and Zhi-Hua Zhou. Subset selection by pareto optimization. In Advances in Neural Information Processing Systems, pages 1774-1782, 2015.","title":"Subset selection by pareto optimization","authors":"Qian","year":"2015","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Qian et al., 2017] Chao Qian, Jing-Cheng Shi, Yang Yu, and Ke Tang. On subset selection with general cost constraints. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pages 2613-2619, 2017.","title":"On subset selection with general cost constraints","authors":"Jing-Cheng Chao Qian, Yang Shi, Ke Yu, Tang","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017)","doi":null,"url":null,"internal_url":"/proceedings/2017/364"},{"position":22,"raw":"[Wolsey, 1982] Laurence A Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Com- binatorica, 2(4):385-393, 1982.","title":"An analysis of the greedy algorithm for the submodular set covering problem","authors":"Laurence A Wolsey","year":"1982","venue":"Combinatorica","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}