{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:10:04Z","timestamp":1748837404779,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030660451"},{"type":"electronic","value":"9783030660468"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-66046-8_41","type":"book-chapter","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T15:02:32Z","timestamp":1609686152000},"page":"499-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Cutting Plane Method for Least Cost Influence Maximization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4208-7023","authenticated-orcid":false,"given":"Cheng-Lung","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1571-0481","authenticated-orcid":false,"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2397-9744","authenticated-orcid":false,"given":"Vladimir","family":"Boginski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"41_CR1","unstructured":"https:\/\/www.python-mip.com\/"},{"issue":"44\u201346","key":"41_CR2","doi-asserted-by":"publisher","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411(44\u201346), 4017\u20134022 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"41_CR3","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01850-3","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V., Castillo, C.: Information and influence propagation in social networks. Synth. Lect. Data Manag. 5(4), 1\u2013177 (2013)","journal-title":"Synth. Lect. Data Manag."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., et al.: How to influence people with partial incentives. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 937\u2013948 (2014)","DOI":"10.1145\/2566486.2568039"},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-018-1288-y","volume":"170","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Kahr, M., Leitner, M., Monaci, M., Ruthmair, M.: Least cost influence propagation in (social) networks. Math. Program. 170(1), 293\u2013325 (2018)","journal-title":"Math. Program."},{"issue":"6","key":"41_CR7","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420\u20131443 (1978)","journal-title":"Am. J. Sociol."},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1002\/net.21941","volume":"76","author":"D G\u00fcnne\u00e7","year":"2020","unstructured":"G\u00fcnne\u00e7, D., Raghavan, S., Zhang, R.: A branch-and-cut approach for the least cost influence problem on social networks. Networks 76(1), 84\u2013105 (2020)","journal-title":"Networks"},{"issue":"2","key":"41_CR9","first-page":"289","volume":"32","author":"D G\u00fcnne\u00e7","year":"2020","unstructured":"G\u00fcnne\u00e7, D., Raghavan, S., Zhang, R.: Least-cost influence maximization on social networks. INFORMS J. Comput. 32(2), 289\u2013302 (2020)","journal-title":"INFORMS J. Comput."},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.knosys.2018.07.040","volume":"161","author":"F Gursoy","year":"2018","unstructured":"Gursoy, F., G\u00fcnne\u00e7, D.: Influence maximization in social networks under deterministic linear threshold model. Knowl.-Based Syst. 161, 111\u2013123 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105\u2013147 (2015)","journal-title":"Theory Comput."},{"issue":"1","key":"41_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85(1), 15\u201333 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-020-01507-z","volume":"183","author":"G Nannicini","year":"2020","unstructured":"Nannicini, G., Sartor, G., Traversi, E., Wolfler Calvo, R.: An exact algorithm for robust influence maximization. Math. Program. 183(1), 419\u2013453 (2020)","journal-title":"Math. Program."},{"issue":"4","key":"41_CR15","first-page":"304","volume":"1","author":"S Raghavan","year":"2019","unstructured":"Raghavan, S., Zhang, R.: A branch-and-cut approach for the weighted target set selection problem on social networks. Inf. J. Optim. 1(4), 304\u2013322 (2019)","journal-title":"Inf. J. Optim."},{"issue":"6684","key":"41_CR16","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"3","key":"41_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10589-017-9958-x","volume":"69","author":"HH Wu","year":"2018","unstructured":"Wu, H.H., K\u00fc\u00e7\u00fckyavuz, S.: A two-stage stochastic programming approach for influence maximization in social networks. Comput. Optim. Appl. 69(3), 563\u2013595 (2018)","journal-title":"Comput. Optim. Appl."}],"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-3-030-66046-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T03:48:57Z","timestamp":1748836137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66046-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030660451","9783030660468"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66046-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 January 2021","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":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2020","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":"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":"83","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":"20","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":"0","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":"24% - 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,4","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":"3","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)"}}]}}