{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:10:07Z","timestamp":1748837407936,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"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":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-66046-8_37","type":"book-chapter","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T15:02:32Z","timestamp":1609686152000},"page":"451-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonsubmodular Constrained Profit Maximization from Increment Perspective"],"prefix":"10.1007","author":[{"given":"Liman","family":"Du","sequence":"first","affiliation":[]},{"given":"Shengminjie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"37_CR1","unstructured":"George D.: Google, Facebook and Amazon are the only winners in Ecommerce. https:\/\/www.entrepreneur.com\/article\/328478. Last accessed 5 Sep 2020"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, New York (2003)","DOI":"10.1145\/956750.956769"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038. ACM, New York (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_91"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259\u2013271. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871637_27"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-77105-0_27","volume-title":"Internet and Network Economics","author":"E Even-Dar","year":"2007","unstructured":"Even-Dar, E., Shapira, A.: A note on maximizing the spread of influence in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 281\u2013286. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_27"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., et al.: Maximizing social influence in nearly optimal time. In: 25th ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. Society for Industrial and Applied Mathematics, USA (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Youze, T., Xiaokui, X., Yanchen, S.: Influence maximization: near-optimal time complexity meets practical efficiency. In: the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD 2014), pp. 75\u201386. ACM, New York (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Youze, T., Yanchen, S., Xiaokui, X.: Influence maximization in near-linear time: a martingale approach. In: The 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD 2015), pp. 1539\u20131554. ACM, New York (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 13th International Conference on Data Mining, Vancouver, BC, pp. 211\u2013220. IEEE (2011)","DOI":"10.1109\/ICDM.2011.132"},{"issue":"6","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans. Knowl. Data Eng. 30(6), 1095\u20131108 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Towards profit maximization for online social network providers. arXiv:1712.08963 (2017)","DOI":"10.1109\/ICNP.2016.7784445"},{"issue":"4","key":"37_CR13","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/090750020","volume":"23","author":"J Lee","year":"2010","unstructured":"Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone sub-modular functions under matroid or knapsack constraints. SIAM J. Disc. Math. 23(4), 2053\u20132078 (2010)","journal-title":"SIAM J. Disc. Math."},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-17572-5_20","volume-title":"Internet and Network Economics","author":"A Gupta","year":"2010","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 246\u2013257. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_20"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), USA, pp. 570\u2013579. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.46"},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s40305-018-0233-3","volume":"7","author":"W Wu","year":"2019","unstructured":"Wu, W., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China 7(2), 183\u2013193 (2019)","journal-title":"J. Oper. Res. Soc. China"},{"key":"37_CR17","unstructured":"Iyer, R., Bilmes, J.: Algorithms for approximate minimization of the difference between submodular functions, with applications. In: 28th Conference on Uncertainty in Artificial Intelligence (UAI 2012), Arlington, Virginia, pp. 407\u2013417. AUAI Press (2012)"},{"key":"37_CR18","unstructured":"Narasimhan M., Bilmes J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: 21st Conference on Uncertainty in Artificial Intelligence (UAI 2005). arXiv:1207.1404"},{"key":"37_CR19","unstructured":"Bai W., Bilmes J.: Greed is still good: maximizing monotone submodular + supermodular functions. In: Dy, J., Krause, A. (eds.) 35th International Conference on Machine Learning (ICML 2018). LNCS, vol. 80. pp. 304\u2013313. PMLR (2018)"},{"issue":"1","key":"37_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s10878-020-00560-w","volume":"40","author":"X Li","year":"2020","unstructured":"Li, X., Du, H.G., Pardalos, P.M.: A variation of DS decomposition in set function optimization. J. Comb. Opt. 40(1), 36\u201344 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00560-w","journal-title":"J. Comb. Opt."},{"issue":"3","key":"37_CR21","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TCSS.2019.2911865","volume":"6","author":"W Yang","year":"2019","unstructured":"Yang, W., et al.: Marginal gains to maximize content spread in social networks. IEEE Trans. Comput. Soc. Syst. 6(3), 479\u2013490 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"4","key":"37_CR22","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10878-020-00638-5","volume":"40","author":"W Yang","year":"2020","unstructured":"Yang, W., Zhang, Y., Du, D.-Z.: Influence maximization problem: properties and algorithms. J. Comb. Opt. 40(4), 907\u2013928 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00638-5","journal-title":"J. Comb. Opt."},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"15095","DOI":"10.1038\/s41598-019-51209-6","volume":"9","author":"\u015e Erkol","year":"2019","unstructured":"Erkol, \u015e., Castellano, C., Radicchi, F.: Systematic comparison between methods for the detection of influential spreaders in complex networks. Sci. Rep. 9, 15095 (2019). https:\/\/doi.org\/10.1038\/s41598-019-51209-6","journal-title":"Sci. Rep."}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T03:48:54Z","timestamp":1748836134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66046-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030660451","9783030660468"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66046-8_37","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)"}}]}}