{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:02Z","timestamp":1740122402687,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772385","61572370"],"award-info":[{"award-number":["61772385","61572370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1907472"],"award-info":[{"award-number":["1907472"]}],"id":[{"id":"10.13039\/100000001","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":[[2021,1]]},"DOI":"10.1007\/s10878-020-00674-1","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T03:02:43Z","timestamp":1606359763000},"page":"213-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Discount allocation for cost minimization in online social networks"],"prefix":"10.1007","volume":"41","author":[{"given":"Qiufen","family":"Ni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Smita","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuanhe","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,26]]},"reference":[{"key":"674_CR1","doi-asserted-by":"crossref","unstructured":"Abebe R, Adamic LA, Kleinberg J (2018) Mitigating overexposure in viral marketing. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11282"},{"key":"674_CR2","doi-asserted-by":"crossref","unstructured":"Choi J, Yi Y (2018) Necessary and sufficient budgets in information source finding with querying: adaptivity gap. In: IEEE international symposium on information theory (ISIT). IEEE, pp 2261\u20132265","DOI":"10.1109\/ISIT.2018.8437499"},{"key":"674_CR3","doi-asserted-by":"crossref","unstructured":"Dhamal S (2018) Effectiveness of diffusing information through a social network in multiple phases. In: IEEE global communications conference (GLOBECOM). IEEE, pp 1\u20137","DOI":"10.1109\/GLOCOM.2018.8647467"},{"key":"674_CR4","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"674_CR5","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin D, Krause A (2011) Adaptive submodularity: theory and applications in active learning and stochastic optimization. J Artif Intell Res 42:427\u2013486","journal-title":"J Artif Intell Res"},{"issue":"1","key":"674_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2011) A data-based approach to social influence maximization. Proc VLDB Endow 5(1):73\u201384","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"674_CR7","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.14778\/3213880.3213883","volume":"11","author":"K Han","year":"2018","unstructured":"Han K, Huang K, Xiao X, Tang J, Sun A, Tang X (2018) Efficient algorithms for adaptive influence maximization. Proc VLDB Endow 11(9):1029\u20131040","journal-title":"Proc VLDB Endow"},{"key":"674_CR8","doi-asserted-by":"crossref","unstructured":"Han K, Xu C, Gui F, Tang S, Huang H, Luo J (2018) Discount allocation for revenue maximization in online social networks. In: Proceedings of the eighteenth ACM international symposium on mobile ad hoc networking and computing. ACM, pp 121\u2013130","DOI":"10.1145\/3209582.3209595"},{"key":"674_CR9","first-page":"110","volume":"78","author":"S Jurvetson","year":"2000","unstructured":"Jurvetson S (2000) What exactly is viral marketing. Red Herring 78:110\u2013112","journal-title":"Red Herring"},{"key":"674_CR10","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"674_CR11","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404\u2013409","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"674_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159\u2013167","journal-title":"Soc Netw"},{"key":"674_CR13","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"674_CR14","doi-asserted-by":"crossref","unstructured":"Salha G, Tziortziotis N, and Vazirgiannis M (2018) Adaptive submodular influence maximization with myopic feedback. In: 2018 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE, pp 455\u2013462","DOI":"10.1109\/ASONAM.2018.8508254"},{"issue":"1","key":"674_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2994501.2994503","volume":"15","author":"Y Singer","year":"2016","unstructured":"Singer Y (2016) Influence maximization through adaptive seeding. ACM SIGecom Exch 15(1):32\u201359","journal-title":"ACM SIGecom Exch"},{"key":"674_CR16","doi-asserted-by":"crossref","unstructured":"Tang S (2018) Stochastic coupon probing in social networks. In: Proceedings of the 27th ACM international conference on information and knowledge management. ACM, pp 1023\u20131031","DOI":"10.1145\/3269206.3271771"},{"key":"674_CR17","doi-asserted-by":"crossref","unstructured":"Tang S (2018) When social advertising meets viral marketing: sequencing social advertisements for influence maximization. In: Thirty-second AAAI conference on artificial intelligence,","DOI":"10.1609\/aaai.v32i1.11306"},{"key":"674_CR18","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, and Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"issue":"1","key":"674_CR19","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 D-Z (2017) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw (TON) 25(1):112\u2013125","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"key":"674_CR20","doi-asserted-by":"crossref","unstructured":"Tong G, Wang R, Ling C, Dong Z, Li X (2020) Time-constrained adaptive influence maximization. arXiv preprint arXiv:2001.01742","DOI":"10.1109\/TCSS.2020.3032616"},{"key":"674_CR21","doi-asserted-by":"crossref","unstructured":"Tong G, Wang R, Li X, Wu W, Du D-Z (2019) An approximation algorithm for active friending in online social networks. In: 2019 IEEE 39th international conference on distributed computing systems (ICDCS). IEEE, pp 1264\u20131274","DOI":"10.1109\/ICDCS.2019.00127"},{"issue":"3","key":"674_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Discov 25(3):545\u2013576","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"674_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10878-015-9870-1","volume":"32","author":"H Wang","year":"2016","unstructured":"Wang H, Liu B, Zhang X, Wu L, Wu W, Gao H (2016) List edge and list total coloring of planar graphs with maximum degree 8. J Comb Optim 32(1):188\u2013197","journal-title":"J Comb Optim"},{"key":"674_CR24","unstructured":"Yang Y, Mao X, Pei J, He X (2016) Continuous influence maximization: what discounts should we offer to social network users? In: Proceedings of the 2016 international conference on management of data. ACM, pp 727\u2013741"},{"key":"674_CR25","unstructured":"Yuan J, Tang S (2016) No time to observe: adaptive influence maximization with partial feedback. arXiv preprint arXiv:1609.00427"},{"key":"674_CR26","doi-asserted-by":"crossref","unstructured":"Yuan J, Tang S-J (2017) Adaptive discount allocation in social networks. In: Proceedings of the 18th ACM international symposium on mobile ad hoc networking and computing. ACM, p\u00a022","DOI":"10.1145\/3084041.3084043"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00674-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00674-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00674-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T22:24:48Z","timestamp":1669760688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00674-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,26]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["674"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00674-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,11,26]]},"assertion":[{"value":"7 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}