{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:48:06Z","timestamp":1743144486648,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819706686"},{"type":"electronic","value":"9789819706693"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0669-3_18","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:20:16Z","timestamp":1709155216000},"page":"186-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Bicriteria Approximation Algorithm for\u00a0Minimum Cost Submodular Cover Problem"],"prefix":"10.1007","author":[{"given":"Canh V.","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quat V.","family":"Phu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dung T. K.","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Vondr\u00e1k, J.: Fast algorithms for maximizing submodular functions. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1497\u20131514. SIAM (2014)","DOI":"10.1137\/1.9781611973402.110"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Peng, R., Tangwongsan, K.: Linear-work greedy parallel approximate set cover and variants. In: Proceedings of the 23rd ACMSPAA 2011, pp. 23\u201332. ACM (2011)","DOI":"10.1145\/1989493.1989497"},{"key":"18_CR3","unstructured":"Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: practical and theoretically optimal submodular maximization in parallel. In: Neural Information Processing Systems (2021)"},{"key":"18_CR4","unstructured":"Crawford, V.: Scalable bicriteria algorithms for non-monotone submodular cover. In: International Conference on Artificial Intelligence and Statistics, pp. 9517\u20139537. PMLR (2023)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Crawford, V.G.: An efficient evolutionary algorithm for minimum cost submodular cover. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, pp. 1227\u20131233. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/171"},{"key":"18_CR6","unstructured":"Crawford, V.G., Kuhnle, A., Thai, M.T.: Submodular cost submodular cover with an approximate oracle. In: Proceedings of the 36th International Conference on Machine Learning, vol. 97, pp. 1426\u20131435. PMLR (2019)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Fahrbach, M., Mirrokni, V.S., Zadimoghaddam, M.: Submodular maximization with nearly optimal approximation, adaptivity and query complexity. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 255\u2013273. SIAM (2019)","DOI":"10.1137\/1.9781611975482.17"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A Goyal","year":"2013","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S., Venkatasubramanian, S.: On minimizing budget and time in influence propagation over social networks. Social Netw. Analys. Min. 3(2), 179\u2013192 (2013)","journal-title":"Social Netw. Analys. Min."},{"key":"18_CR10","unstructured":"Guillory, A., Bilmes, J.A.: Simultaneous learning and covering with adversarial noise. In: Getoor, L., Scheffer, T. (eds.) Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, 2011, pp. 369\u2013376. Omnipress (2011)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kuhnle, A., Pan, T., Alim, M.A., Thai, M.T.: Scalable bicriteria algorithms for the threshold activation problem in online social networks. In: IEEE Conference on Computer Communications, pp. 1\u20139 (2017)","DOI":"10.1109\/INFOCOM.2017.8057068"},{"key":"18_CR12","unstructured":"Kuhnle, A., Smith, J.D., Crawford, V.G., Thai, M.T.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Dy, J.G., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2791\u20132800. PMLR (2018)"},{"key":"18_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"18_CR14","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A.: Fast constrained submodular maximization: personalized data summarization. In: Proceedings of the 33nd International Conference on Machine Learning. JMLR Workshop and Conference Proceedings, vol. 48, pp. 1358\u20131367. JMLR.org (2016)"},{"key":"18_CR15","unstructured":"Mirzasoleiman, B., Karbasi, A., Badanidiyuru, A., Krause, A.: Distributed submodular cover: succinctly summarizing massive data. In: Annual Conference on Neural Information Processing Systems, pp. 2881\u20132889 (2015)"},{"key":"18_CR16","unstructured":"Mirzasoleiman, B., Zadimoghaddam, M., Karbasi, A.: Fast distributed submodular cover: public-private data summarization. In: Annual Conference on Neural Information Processing Systems, pp. 3594\u20133602 (2016)"},{"key":"18_CR17","unstructured":"Norouzi-Fard, A., Bazzi, A., Bogunovic, I., El Halabi, M., Hsieh, Y.P., Cevher, V.: An efficient streaming algorithm for the submodular cover problem. In: Advances in Neural Information Processing Systems, vol. 29 (2016)"},{"key":"18_CR18","unstructured":"Norouzi-Fard, A., Bazzi, A., Bogunovic, I., Halabi, M.E., Hsieh, Y., Cevher, V.: An efficient streaming algorithm for the submodular cover problem. In: Annual Conference on Neural Information Processing Systems, pp. 4493\u20134501 (2016)"},{"issue":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s10878-019-00439-5","volume":"38","author":"CV Pham","year":"2019","unstructured":"Pham, C.V., Phu, Q.V., Hoang, H.X., Pei, J., Thai, M.T.: Minimum budget for misinformation blocking in online social networks. J. Comb. Optim. 38(4), 1101\u20131127 (2019)","journal-title":"J. Comb. Optim."},{"key":"18_CR20","unstructured":"Ran, Y., Zhang, Z., Tang, S.: Improved parallel algorithm for minimum cost submodular cover problem. In: Proceedings of the Learning Theory. Proceedings of MLS, vol. 178, pp. 3490\u20133502. PMLR (2022)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"18_CR22","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Annual Conference on Neural Information Processing Systems, pp. 847\u2013855 (2015)"},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10589-009-9269-y","volume":"45","author":"P Wan","year":"2010","unstructured":"Wan, P., Du, D., Pardalos, P.M., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2), 463\u2013474 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"18_CR24","first-page":"385","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Comb. 2(4), 385\u2013393 (1982)","journal-title":"Comb."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0669-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:24:17Z","timestamp":1709155457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0669-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819706686","9789819706693"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0669-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/csonet23\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The four extended abstracts are also included in this proceedings.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}