{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:10Z","timestamp":1750220170463,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1145\/3568562.3568668","type":"proceedings-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:25:01Z","timestamp":1669681501000},"page":"442-449","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Submodular Cover Problem: Application and Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7041-9531","authenticated-orcid":false,"given":"Phuong","family":"N. H. Pham","sequence":"first","affiliation":[{"name":"Falcuty of Information Technology, Ho Chi Minh City University of Food Industry, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-1169","authenticated-orcid":false,"given":"Quy","family":"T. N. Co","sequence":"additional","affiliation":[{"name":"Falcuty of Information Technology, Ho Chi Minh City University of Food Industry, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9838-0966","authenticated-orcid":false,"given":"Anh","family":"N. Su","sequence":"additional","affiliation":[{"name":"People's Security Academy, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-1019","authenticated-orcid":false,"given":"Phuong","family":"T. Pham","sequence":"additional","affiliation":[{"name":"GHTK Joint Stock Company, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8118-1768","authenticated-orcid":false,"given":"Canh","family":"V. Pham","sequence":"additional","affiliation":[{"name":"Phenikaa University, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9600-8319","authenticated-orcid":false,"given":"Vaclav","family":"Snasel","sequence":"additional","affiliation":[{"name":"VSB-Technical University of VSB-Technical University of Ostrava, Czechia"}]}],"member":"320","published-online":{"date-parts":[[2022,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_2_1","unstructured":"Ryan Gomes and Andreas Krause. 2010. Budgeted nonparametric learning from data streams. In ICML.  Ryan Gomes and Andreas Krause. 2010. Budgeted nonparametric learning from data streams. In ICML."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0062-z"},{"key":"e_1_3_2_1_4_1","volume-title":"Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia-Pacific Journal of Operational Research","author":"Ha TK","year":"2022","unstructured":"Dung\u00a0 TK Ha , Canh\u00a0 V Pham , and Huan\u00a0 X Hoang . 2022. Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia-Pacific Journal of Operational Research ( 2022 ), 2250013. Dung\u00a0TK Ha, Canh\u00a0V Pham, and Huan\u00a0X Hoang. 2022. Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia-Pacific Journal of Operational Research (2022), 2250013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884465"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809814"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_9_1","volume-title":"Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held","author":"J.","year":"2012","unstructured":"Julian\u00a0 J. McAuley and Jure Leskovec. 2012. Learning to Discover Social Circles in Ego Networks . In Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012 , Lake Tahoe, Nevada, United States, Peter\u00a0L. Bartlett, Fernando C.\u00a0N. Pereira, Christopher J.\u00a0C. Burges, L\u00e9on Bottou, and Kilian\u00a0Q. Weinberger (Eds.). 548\u2013556. https:\/\/proceedings.neurips.cc\/paper\/ 2012\/hash\/7a614fd06c325499f1680b9896beedeb-Abstract.html Julian\u00a0J. McAuley and Jure Leskovec. 2012. Learning to Discover Social Circles in Ego Networks. In Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012, Lake Tahoe, Nevada, United States, Peter\u00a0L. Bartlett, Fernando C.\u00a0N. Pereira, Christopher J.\u00a0C. Burges, L\u00e9on Bottou, and Kilian\u00a0Q. Weinberger (Eds.). 548\u2013556. https:\/\/proceedings.neurips.cc\/paper\/2012\/hash\/7a614fd06c325499f1680b9896beedeb-Abstract.html"},{"key":"e_1_3_2_1_10_1","volume-title":"Distributed Submodular Cover: Succinctly Summarizing Massive Data. In In Proc. of Annual Conference on Neural Information Processing Systems (NIPS). 2881\u20132889","author":"Mirzasoleiman Baharan","year":"2015","unstructured":"Baharan Mirzasoleiman , Amin Karbasi , Ashwinkumar Badanidiyuru , and Andreas Krause . 2015 . Distributed Submodular Cover: Succinctly Summarizing Massive Data. In In Proc. of Annual Conference on Neural Information Processing Systems (NIPS). 2881\u20132889 . Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, and Andreas Krause. 2015. Distributed Submodular Cover: Succinctly Summarizing Massive Data. In In Proc. of Annual Conference on Neural Information Processing Systems (NIPS). 2881\u20132889."},{"key":"e_1_3_2_1_11_1","volume-title":"In Proc. of the International Conference on Machine Learning (ICML). 7338\u20137347","author":"Nguyen Lan","year":"2020","unstructured":"Lan Nguyen and My Thai . 2020 . Streaming k-Submodular Maximization under Noise subject to Size Constraint . In In Proc. of the International Conference on Machine Learning (ICML). 7338\u20137347 . Lan Nguyen and My Thai. 2020. Streaming k-Submodular Maximization under Noise subject to Size Constraint. In In Proc. of the International Conference on Machine Learning (ICML). 7338\u20137347."},{"key":"e_1_3_2_1_12_1","volume-title":"An efficient streaming algorithm for the submodular cover problem. Advances in Neural Information Processing Systems 29","author":"Norouzi-Fard Ashkan","year":"2016","unstructured":"Ashkan Norouzi-Fard , Abbas Bazzi , Ilija Bogunovic , Marwa El\u00a0Halabi , Ya-Ping Hsieh , and Volkan Cevher . 2016. An efficient streaming algorithm for the submodular cover problem. Advances in Neural Information Processing Systems 29 ( 2016 ). Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El\u00a0Halabi, Ya-Ping Hsieh, and Volkan Cevher. 2016. An efficient streaming algorithm for the submodular cover problem. Advances in Neural Information Processing Systems 29 (2016)."},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Machine Learning. PMLR, 3829\u20133838","author":"Norouzi-Fard Ashkan","year":"2018","unstructured":"Ashkan Norouzi-Fard , Jakub Tarnawski , Slobodan Mitrovic , Amir Zandieh , Aidasadat Mousavifar , and Ola Svensson . 2018 . Beyond 1\/2-approximation for submodular maximization on massive data streams . In International Conference on Machine Learning. PMLR, 3829\u20133838 . Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, and Ola Svensson. 2018. Beyond 1\/2-approximation for submodular maximization on massive data streams. In International Conference on Machine Learning. PMLR, 3829\u20133838."},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015","author":"Ohsaka Naoto","year":"2015","unstructured":"Naoto Ohsaka and Yuichi Yoshida . 2015 . Monotone k-Submodular Function Maximization with Size Constraints . In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015 , December 7-12, 2015, Montreal, Quebec, Canada, Corinna Cortes, Neil\u00a0D. Lawrence, Daniel\u00a0D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 694\u2013702. https:\/\/proceedings.neurips.cc\/paper\/ 2015\/hash\/f770b62bc8f42a0b66751fe636fc6eb0-Abstract.html Naoto Ohsaka and Yuichi Yoshida. 2015. Monotone k-Submodular Function Maximization with Size Constraints. In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada, Corinna Cortes, Neil\u00a0D. Lawrence, Daniel\u00a0D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 694\u2013702. https:\/\/proceedings.neurips.cc\/paper\/2015\/hash\/f770b62bc8f42a0b66751fe636fc6eb0-Abstract.html"},{"key":"e_1_3_2_1_15_1","volume-title":"In Proc. of International Workshop Combinatorial Algorithms (IWOCA), Ljiljana Brankovic, Joe Ryan, and William\u00a0F. Smyth (Eds.). 88\u201399","author":"Oshima Hiroki","year":"2017","unstructured":"Hiroki Oshima . 2017 . Derandomization for k-Submodular Maximization . In In Proc. of International Workshop Combinatorial Algorithms (IWOCA), Ljiljana Brankovic, Joe Ryan, and William\u00a0F. Smyth (Eds.). 88\u201399 . Hiroki Oshima. 2017. Derandomization for k-Submodular Maximization. In In Proc. of International Workshop Combinatorial Algorithms (IWOCA), Ljiljana Brankovic, Joe Ryan, and William\u00a0F. Smyth (Eds.). 88\u201399."},{"key":"e_1_3_2_1_16_1","volume-title":"Minimum budget for misinformation detection in online social networks with provable guarantees. Optimization letters 16, 2","author":"Pham V","year":"2022","unstructured":"Canh\u00a0 V Pham , Dung\u00a0 V Pham , Bao\u00a0 Q Bui , and Anh\u00a0 V Nguyen . 2022. Minimum budget for misinformation detection in online social networks with provable guarantees. Optimization letters 16, 2 ( 2022 ), 515\u2013544. Canh\u00a0V Pham, Dung\u00a0V Pham, Bao\u00a0Q Bui, and Anh\u00a0V Nguyen. 2022. Minimum budget for misinformation detection in online social networks with provable guarantees. Optimization letters 16, 2 (2022), 515\u2013544."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42345-6_10"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00858-x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2749263"},{"key":"e_1_3_2_1_20_1","volume-title":"In Proc. of the International Conference on Machine Learning (ICML). 7887\u20137897","author":"Rafiey Akbar","year":"2020","unstructured":"Akbar Rafiey and Yuichi Yoshida . 2020 . Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints . In In Proc. of the International Conference on Machine Learning (ICML). 7887\u20137897 . Akbar Rafiey and Yuichi Yoshida. 2020. Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. In In Proc. of the International Conference on Machine Learning (ICML). 7887\u20137897."},{"key":"e_1_3_2_1_21_1","volume-title":"Second International Semantic Web Conference","author":"Richardson Matthew","year":"2003","unstructured":"Matthew Richardson , Rakesh Agrawal , and Pedro\u00a0 M. Domingos . 2003 . Trust Management for the Semantic Web. In The Semantic Web - ISWC 2003 , Second International Semantic Web Conference , Sanibel Island, FL, USA , October 20-23, 2003, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02870), Dieter Fensel, Katia\u00a0P. Sycara, and John Mylopoulos (Eds.). Springer, 351\u2013368. https:\/\/doi.org\/10.1007\/978-3-540-39718-2_23 10.1007\/978-3-540-39718-2_23 Matthew Richardson, Rakesh Agrawal, and Pedro\u00a0M. Domingos. 2003. Trust Management for the Semantic Web. In The Semantic Web - ISWC 2003, Second International Semantic Web Conference, Sanibel Island, FL, USA, October 20-23, 2003, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02870), Dieter Fensel, Katia\u00a0P. Sycara, and John Mylopoulos (Eds.). Springer, 351\u2013368. https:\/\/doi.org\/10.1007\/978-3-540-39718-2_23"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2017.01.003"},{"key":"e_1_3_2_1_23_1","volume-title":"On Bisubmodular Maximization. In In Proc. of the International Conference on Artificial Intelligence and Statistics (AISTATS). 1055\u20131063","author":"Singh P.","year":"2012","unstructured":"Ajit\u00a0 P. Singh , Andrew Guillory , and Jeff\u00a0 A. Bilmes . 2012 . On Bisubmodular Maximization. In In Proc. of the International Conference on Artificial Intelligence and Statistics (AISTATS). 1055\u20131063 . Ajit\u00a0P. Singh, Andrew Guillory, and Jeff\u00a0A. Bilmes. 2012. On Bisubmodular Maximization. In In Proc. of the International Conference on Artificial Intelligence and Statistics (AISTATS). 1055\u20131063."},{"key":"e_1_3_2_1_24_1","volume-title":"In Proc. of Annual Conference on Neural Information Processing Systems (NIPS), Corinna Cortes, Neil\u00a0D","author":"Soma Tasuku","year":"2015","unstructured":"Tasuku Soma and Yuichi Yoshida . 2015 . A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice . In In Proc. of Annual Conference on Neural Information Processing Systems (NIPS), Corinna Cortes, Neil\u00a0D . Lawrence, Daniel\u00a0D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 847\u2013855. Tasuku Soma and Yuichi Yoshida. 2015. A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice. In In Proc. of Annual Conference on Neural Information Processing Systems (NIPS), Corinna Cortes, Neil\u00a0D. Lawrence, Daniel\u00a0D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 847\u2013855."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_26_1","unstructured":"Zhongzheng Tang Chenhao Wang and Hau Chan. 2021. On maximizing a monotone k-submodular function under a knapsack constraint. CoRR abs\/2105.15159(2021). https:\/\/arxiv.org\/abs\/2105.15159  Zhongzheng Tang Chenhao Wang and Hau Chan. 2021. On maximizing a monotone k-submodular function under a knapsack constraint. CoRR abs\/2105.15159(2021). https:\/\/arxiv.org\/abs\/2105.15159"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2021.11.010"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.108"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00042"}],"event":{"name":"SoICT 2022: The 11th International Symposium on Information and Communication Technology","acronym":"SoICT 2022","location":"Hanoi Vietnam"},"container-title":["The 11th International Symposium on Information and Communication Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568562.3568668","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3568562.3568668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:40Z","timestamp":1750186840000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568562.3568668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":29,"alternative-id":["10.1145\/3568562.3568668","10.1145\/3568562"],"URL":"https:\/\/doi.org\/10.1145\/3568562.3568668","relation":{},"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"2022-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}