{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:12Z","timestamp":1759638552958,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:00:00Z","timestamp":1625443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:00:00Z","timestamp":1625443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071459"],"award-info":[{"award-number":["12071459"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991022"],"award-info":[{"award-number":["11991022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00774-6","type":"journal-article","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T07:02:56Z","timestamp":1625468576000},"page":"2598-2625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Nonsubmodular constrained profit maximization from increment perspective"],"prefix":"10.1007","volume":"44","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,7,5]]},"reference":[{"key":"774_CR1","unstructured":"Bai W, Bilmes J (2018) Greed is still good: maximizing monotone submodular + supermodular functions. In: Dy J, Krause A (eds), 35th international conference on machine learning (ICML 2018), LNCS, PMLR, vol 80, pp 304\u2013313"},{"key":"774_CR2","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, et al (2014) Maximizing social influence in nearly optimal time. In: 25th ACM-SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, USA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"774_CR3","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"issue":"3","key":"774_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TSC.2014.2310216","volume":"7","author":"M Doo","year":"2014","unstructured":"Doo M, Liu L (2014) Probabilistic diffusion of social influence with incentives. IEEE Trans Serv Comput 7(3):387\u2013400","journal-title":"IEEE Trans Serv Comput"},{"key":"774_CR5","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 (2019) Systematic comparison between methods for the detection of influential spreaders in complex networks. Sci Rep 9:15095","journal-title":"Sci Rep"},{"key":"774_CR6","doi-asserted-by":"crossref","unstructured":"Even-Dar E, Shapira A (2007) A note on maximizing the spread of influence in social networks. In: Deng X, Graham FC (eds), Internet and network economics. WINE 2007. LNCS, vol 4858, Springer, Berlin, Heidelberg, pp 281\u2013286","DOI":"10.1007\/978-3-540-77105-0_27"},{"key":"774_CR7","doi-asserted-by":"crossref","unstructured":"Feldman M, Naor J, Schwartz R (2011) A unified continuous greedy algorithm for submodular maximization. In: 52nd annual symposium on foundations of computer science (FOCS\u201911), IEEE Computer Society, USA, pp 570\u2013579","DOI":"10.1109\/FOCS.2011.46"},{"key":"774_CR8","unstructured":"George D (2020) Google, Facebook and Amazon are the only winners in Ecommerce. https:\/\/www.entrepreneur.com\/article\/328478. Accessed 5 Sep"},{"key":"774_CR9","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 13th international conference on data mining, IEEE, Vancouver, BC, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"774_CR10","doi-asserted-by":"crossref","unstructured":"Gupta A, Roth A, Schoenebeck G, Talwar K (2010) Constrained non-monotone submodular maximization: offline and secretary algorithms. In: Saberi A (eds.), Internet and network economics. WINE 2010. LNCS, vol 6484, Springer, Berlin, Heidelberg, pp 246\u2013257","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"774_CR11","unstructured":"Iyer R, Bilmes J (2012) Algorithms for approximate minimization of the difference between submodular functions, with applications. In: 28th conference on uncertainty in artificial intelligence (UAI\u201912), AUAI Press, Arlington, Virginia, pp 407\u2013417"},{"key":"774_CR12","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"774_CR13","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds), Automata, languages and programming, ICALP 2005, LNCS, vol 3580, Springer, Berlin, Heidelberg, pp 1127\u20131138","DOI":"10.1007\/11523468_91"},{"key":"774_CR14","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds.), Knowledge discovery in databases. PKDD 2006, LNCS, vol 4213, Springer, Berlin, Heidelberg, pp 259\u2013271","DOI":"10.1007\/11871637_27"},{"issue":"4","key":"774_CR15","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 (2010) Maximizing nonmonotone sub-modular functions under matroid or knapsack constraints. SIAM J Discrete Math 23(4):2053\u20132078","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"774_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick SS, Sun A, Cui J (2015) Conformity-aware influence maximization in online social networks. VLDB J 24(1):117\u2013141","journal-title":"VLDB J"},{"key":"774_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.neucom.2017.03.003","volume":"260","author":"D Li","year":"2017","unstructured":"Li D, Wang C, Zhang S, Zhou G, Chu D, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69\u201378","journal-title":"Neurocomputing"},{"issue":"1","key":"774_CR18","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 HG, Parsalos PM (2020) A variation of DS decomposition in set function optimization. J Comb Optim 40(1):36\u201344","journal-title":"J Comb Optim"},{"issue":"C","key":"774_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.knosys.2016.07.008","volume":"109","author":"W Liu","year":"2016","unstructured":"Liu W, Yue K, Wu H, Li J, Liu D, Tang D (2016) Containment of competitive influence spread in social networks. Knowl Based Syst 109(C):266\u2013275","journal-title":"Knowl Based Syst"},{"key":"774_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.engappai.2015.02.007","volume":"41","author":"Rezvan Mohamadi-Baghmolaei","year":"2015","unstructured":"Mohamadi-Baghmolaei Rezvan, Mozafari Niloofar, Hamzeh Ali (2015) Trust based latency aware influence maximization in social networks. Eng Appl Artif Intell 41:95\u2013206","journal-title":"Eng Appl Artif Intell"},{"key":"774_CR21","unstructured":"Narasimhan M, Bilmes J (2012) A submodular-supermodular procedure with applications to discriminative structure learning. In: 21st conference on uncertainty in artificial intelligence (UAI2005). arXiv:1207.1404"},{"issue":"6","key":"774_CR22","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 (2018) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng 30(6):1095\u20131108","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"774_CR23","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2017) Towards profit maximization for online social network providers. arXiv:1712.08963","DOI":"10.1109\/INFOCOM.2018.8485975"},{"issue":"1","key":"774_CR24","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong G, Wu W, Tang S, Du DZ (2017) Adaptive influence maximization in dynamic social networks. IEEE ACM Trans Netw 25(1):112\u2013125","journal-title":"IEEE ACM Trans Netw"},{"key":"774_CR25","doi-asserted-by":"crossref","unstructured":"Wang F, Wang G, Xie D (2016) Maximizing the spread of positive influence under LT-MLA model. In: Asia-Pacific services computing conference, Springer, pp 450\u2013463","DOI":"10.1007\/978-3-319-49178-3_34"},{"issue":"2","key":"774_CR26","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 DZ (2019) Set function optimization. J Oper Res Soc China 7(2):183\u2013193","journal-title":"J Oper Res Soc China"},{"issue":"3","key":"774_CR27","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 (2019) Marginal gains to maximize content spread in social networks. IEEE Trans Comput Soc Syst 6(3):479\u2013490","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"774_CR28","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 DZ (2020) Influence maximization problem: properties and algorithms. J Comb Optim 40:907\u2013928","journal-title":"J Comb Optim"},{"key":"774_CR29","unstructured":"Youze T, Xiaokui X, Yanchen S (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: the 2014 ACM SIGMOD international conference on management of data (SIGMOD\u201914), ACM, New York, pp 75\u201386"},{"key":"774_CR30","unstructured":"Youze T, Yanchen S, Xiaokui X (2015) Influence maximization in near-linear time: a martingale approach. In: the 2015 ACM SIGMOD international conference on management of data (SIGMOD\u201915), ACM, New York, pp 1539\u20131554"},{"key":"774_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.eswa.2016.01.008","volume":"55","author":"Y Zeng","year":"2016","unstructured":"Zeng Y, Chen X, Cong G, Qin S, Tang J, Xiang Y (2016) Maximizing influence under influence loss constraint in social networks. Expert Syst Appl 55:255\u2013267","journal-title":"Expert Syst Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00774-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00774-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00774-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:19:59Z","timestamp":1665778799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00774-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,5]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["774"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00774-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,7,5]]},"assertion":[{"value":"24 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}