{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T07:24:55Z","timestamp":1749108295947,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1948550"],"award-info":[{"award-number":["1948550"]}],"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":[[2020,11]]},"DOI":"10.1007\/s10878-020-00639-4","type":"journal-article","created":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T21:03:24Z","timestamp":1597871004000},"page":"901-906","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A short proof for stronger version of DS decomposition in set function optimization"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7761-6212","authenticated-orcid":false,"given":"Xiang","family":"Li","sequence":"first","affiliation":[]},{"given":"H. George","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,19]]},"reference":[{"key":"639_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and analysis of approximation algorithms","author":"DZ Du","year":"2012","unstructured":"Du DZ, Ko KI, Hu X (2012) Design and analysis of approximation algorithms. Springer, Berlin"},{"issue":"1","key":"639_CR2","doi-asserted-by":"publisher","first-page":"2050007:1","DOI":"10.1142\/S179383092050007X","volume":"12","author":"S Gu","year":"2020","unstructured":"Gu S, Shi G, Wu W, Lu C (2020) A fast double greedy algorithm for non-monotone DR-submodular function maximization. Discrete Math Algorithm Appl. 12(1):2050007:1\u20132050007:11","journal-title":"Discrete Math Algorithm Appl."},{"issue":"4","key":"639_CR3","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TCSS.2019.2926112","volume":"6","author":"J Guo","year":"2019","unstructured":"Guo J, Weili W (2019) A novel scene of viral marketing for complementary products. IEEE Trans Comput Soc Syst 6(4):797\u2013808","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"639_CR4","unstructured":"Iyer R, Bilmes J (2012) Algorithms for approximate minimization of the difference between submodular functions. In: Proc, UAI"},{"issue":"6","key":"639_CR5","doi-asserted-by":"publisher","first-page":"1950075:1","DOI":"10.1142\/S1793830919500757","volume":"11","author":"L Lai","year":"2019","unstructured":"Lai L, Ni Q, Lu C, Huang C, Wu W (2019) Monotone submodular maximization over the bounded integer lattice with cardinality constraints. Discret Math Algorithm Appl 11(6):1950075:1\u20131950075:14","journal-title":"Discret Math Algorithm Appl"},{"issue":"1","key":"639_CR6","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, Pardalos PM (2020) A variation of DS decomposition in set function optimization. J Comb Optim 40(1):36\u201344","journal-title":"J Comb Optim"},{"key":"639_CR7","doi-asserted-by":"crossref","unstructured":"Lu W, Chen W, Lakshmanan LVS (2015) From competition to complementarity: comparative influence diffusion and maximization. In: Proceedings of the VLDB endowment 9(2): 60\u201371","DOI":"10.14778\/2850578.2850581"},{"key":"639_CR8","unstructured":"Narasimhan M, Bilmes J (2005) A submodular-supermodular procedure with applications to discriminative structure learning. In: Proc, UAI"},{"issue":"1","key":"639_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s13278-020-00653-8","volume":"10","author":"G Shuyang","year":"2020","unstructured":"Shuyang G, Gao C, Yang R, Weili W, Wang H, Dachuan X (2020) A general method of active friending in different diffusion models in social networks. Soc Netw Anal Min 10(1):41","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"639_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s40305-018-0233-3","volume":"7","author":"W Weili","year":"2019","unstructured":"Weili W, Zhang Z, Ding-Zu D (2019) Set function optimization. J Oper Res Soc China 7(2):183\u2013193","journal-title":"J Oper Res Soc China"},{"key":"639_CR11","doi-asserted-by":"crossref","unstructured":"Yang DN, Hung HJ, Lee WC, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. In: KDD, pp. 713\u2013721","DOI":"10.1145\/2487575.2487599"},{"key":"639_CR12","doi-asserted-by":"crossref","unstructured":"Yuan J, Weili W, Yi L, Ding-Zhu D(2017) Active friending in online social networks. In: BDCAT, pp. 139\u2013148","DOI":"10.1145\/3148055.3148073"},{"key":"639_CR13","doi-asserted-by":"crossref","unstructured":"Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: ICDCS, pp 317\u2013326","DOI":"10.1109\/ICDCS.2013.37"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00639-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00639-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00639-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T23:56:34Z","timestamp":1629330994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00639-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,19]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["639"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00639-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,8,19]]},"assertion":[{"value":"19 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}