{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T19:27:01Z","timestamp":1783625221679,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030349790","type":"print"},{"value":"9783030349806","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34980-6_14","type":"book-chapter","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T06:03:07Z","timestamp":1573452187000},"page":"120-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing"],"prefix":"10.1007","author":[{"given":"Canh V.","family":"Pham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hieu V.","family":"Duong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J.T., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"FRK Chung","year":"2006","unstructured":"Chung, F.R.K., Lu, L.: Survey: concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Nguyen, D.T., Thai, M.T.: Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: 23rd ACM Conference on Hypertext and Social Media, HT 2012, pp. 165\u2013174 (2012)","DOI":"10.1145\/2309996.2310024"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"Dinh, T.N., Shen, Y., Nguyen, D.T., Thai, M.T.: On the approximability of positive influence dominating set in social networks. J. Comb. Optim. 27(3), 487\u2013503 (2014)","journal-title":"J. Comb. Optim."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM International Conference on Knowledge Discovery and Data Mining SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","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.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM TWEB 1(1), 5 (2007)","journal-title":"ACM TWEB"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: densification and shrinking diameters. TKDD 1(1), 2 (2007)","journal-title":"TKDD"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Li, X., Smith, J.D., Dinh, T.N., Thai, M.T.: Why approximate when you can get the exact? Optimal targeted viral marketing at scale. In: 2017 IEEE Conference on Computer Communications, INFOCOM 2017, pp. 1\u20139 (2017)","DOI":"10.1109\/INFOCOM.2017.8057069"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Dinh, T.N., Thai, M.T.: Cost-aware targeted viral marketing in billion-scale networks. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Dinh, T.N., Thai, M.T.: Revisiting of \u2018revisiting the stop-and-stare algorithms for influence maximization\u2019. In: 7th International Conference on Computational Data and Social Networks, CSoNet 2018, pp. 273\u2013285 (2018)","DOI":"10.1007\/978-3-030-04648-4_23"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Nguyen, T.P., Phan, N.H., Dinh, T.N.: Importance sketching of influence dynamics in billion-scale networks. In: 2017 IEEE International Conference on Data Mining, ICDM 2017, pp. 337\u2013346 (2017)","DOI":"10.1109\/ICDM.2017.43"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans. Netw. 25(4), 2419\u20132429 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"10","key":"14_CR15","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1016\/j.comnet.2013.04.002","volume":"57","author":"NP Nguyen","year":"2013","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T.: Analysis of misinformation containment in online social networks. Comput. Netw. 57(10), 2133\u20132146 (2013)","journal-title":"Comput. Netw."},{"issue":"11","key":"14_CR16","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.3390\/app9112274","volume":"9","author":"Canh V. Pham","year":"2019","unstructured":"Pham, C.V., Duong, H.V., Hoang, H.X., Thai, M.T.: Competitive influence maximization within time and budget constraints in online social networks: an algorithmic approach. Appl. Sci. 9(11), 2274 (2019)","journal-title":"Applied Sciences"},{"key":"14_CR17","unstructured":"Pham, C.V., Duong, H.V., Thai, M.T.: Importance sample-based approximation algorithm for cost-aware targeted viral marketing. \nhttps:\/\/arxiv.org\/abs\/1910.04134"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1007\/s10878-018-0252-3","volume":"35","author":"Canh V. Pham","year":"2018","unstructured":"Pham, C.V., Thai, M.T., Duong, H.V., Bui, B.Q., Hoang, H.X.: Maximizing misinformation restriction within time and budget constraints. J. Comb. Optim. 35(4), 1202\u20131240 (2018). \nhttps:\/\/doi.org\/10.1007\/s10878-018-0252-3","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 351\u2013368. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-39718-2_23"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Shen, Y., Dinh, T.N., Zhang, H., Thai, M.T.: Interest-matching information propagation in multiple online social networks. In: 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, pp. 1824\u20131828 (2012)","DOI":"10.1145\/2396761.2398525"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM International Conference on Management of Data (SIGMOD), pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: International Conference on Management of Data, SIGMOD 2014, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: 12th IEEE International Conference on Data Mining, ICDM 2012, Brussels, Belgium, 10\u201313 December 2012, pp. 745\u2013754 (2012)","DOI":"10.1109\/ICDM.2012.138"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TNET.2015.2394793","volume":"24","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Nguyen, D.T., Zhang, H., Thai, M.T.: Least cost influence maximization across multiple social networks. IEEE\/ACM Trans. Netw. 24(2), 929\u2013939 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhang, H., Kuhnle, A., Thai, M.T.: Profit maximization for multiple products in online social networks. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, 10\u201314 April 2016, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21786-4_4","volume-title":"Computational Social Networks","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Zhang, H., Li, X., Thai, M.T.: Limiting the spread of misinformation while effectively raising awareness in social networks. In: Thai, M.T., Nguyen, N.P., Shen, H. (eds.) CSoNet 2015. LNCS, vol. 9197, pp. 35\u201347. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21786-4_4"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34980-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T06:10:58Z","timestamp":1573452658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34980-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349790","9783030349806"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34980-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 November 2019","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":"Ho Chi Minh City","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"22","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":"8","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":"18% - 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":"3","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":"5","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)"}}]}}