{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:24Z","timestamp":1759638204843},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10878-020-00560-w","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T18:03:07Z","timestamp":1584640987000},"page":"36-44","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A variation of DS decomposition in set function optimization"],"prefix":"10.1007","volume":"40","author":[{"given":"Xiang","family":"Li","sequence":"first","affiliation":[]},{"given":"H. George","family":"Du","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"560_CR1","doi-asserted-by":"crossref","unstructured":"Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robus influence maximization. In: KDD\u201916. CA, USA, San Francisco","DOI":"10.1145\/2939672.2939745"},{"key":"560_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Desin and analysis of approximation algorithms","author":"DZ Du","year":"2012","unstructured":"Du DZ, Ko KI, Hu X (2012) Desin and analysis of approximation algorithms. Springer, Berlin"},{"key":"560_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"560_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-030-16194-1_12","volume-title":"Nonlinear combinatorial optimization","author":"S Gu","year":"2019","unstructured":"Gu S, Du H, Thai MT, Du D-Z (2019) Friending. In: Du D-Z, Pardalas PM, Zhang Z (eds) Nonlinear combinatorial optimization. Springer, Berlin, pp 265\u2013272"},{"key":"560_CR5","unstructured":"Iyer R, Bilmes J (2012) Algorithms for approximate minimization of the difference between submodular functions. In: Proceeding of UAI"},{"key":"560_CR6","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. KDD, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"560_CR7","doi-asserted-by":"crossref","unstructured":"Lu W, Chen W, Lakshmanan LV S (2016a) From competition to complementarity: comparative influence diffusion and maximization. In: Proceeding the VLDB Endowsment, vol 9, no 2, pp 60\u201371","DOI":"10.14778\/2850578.2850581"},{"key":"560_CR8","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10878-016-0006-z","volume":"33","author":"Z Lu","year":"2016","unstructured":"Lu Z, Zhang Z, Wu W (2016b) Solution of Bharathi\u2013Kempe\u2013Salek conjecture on influence maximization in arborescence. J Comb Optim 33:803\u2013808","journal-title":"J Comb Optim"},{"key":"560_CR9","unstructured":"Narasimhan M, Bilmes J (2005) A submodular\u2013supermodular procedure with applications to discriminative structure learning. In: Proceeding of UAI"},{"key":"560_CR10","doi-asserted-by":"publisher","first-page":"237C251","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin JB (2009) A faster strongly polynomial time algorithm for submodular function minimization. Math Program 118:237C251","journal-title":"Math Program"},{"key":"560_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver A (2000) A combinatorial algorithm minimizing submodular functions in strong polynomial time. J Comb Theory (B) 80:346\u2013355","journal-title":"J Comb Theory (B)"},{"issue":"1","key":"560_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A Schrijver","year":"1991","unstructured":"Schrijver A, Yannakakis M (1991) Simple local search problems that hard to solve. SIAM J Comput 20(1):56\u201387","journal-title":"SIAM J Comput"},{"key":"560_CR13","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1007\/s10878-016-9991-1","volume":"31","author":"A Wang","year":"2016","unstructured":"Wang A, Wu W, Cui L (2016) On Bharathi\u2013Kempe\u2013Salek conjecture on influence maximization in arborescence. J Comb Optim 31:1678\u20131684","journal-title":"J Comb Optim"},{"issue":"2","key":"560_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s40305-018-0233-3","volume":"7","author":"WL Wu","year":"2019","unstructured":"Wu WL, Zhang Z, Du DZ (2019) Set function optimization. J Oper Res Soc China 7(2):183\u2013193","journal-title":"J Oper Res Soc China"},{"key":"560_CR15","doi-asserted-by":"crossref","unstructured":"Yang DN, Hung HJ, Lee WC, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. KDD, Wei Chen, pp 713\u2013721","DOI":"10.1145\/2487575.2487599"},{"key":"560_CR16","doi-asserted-by":"crossref","unstructured":"Yuan J, Wu W, Li Y, Du D-Z (2017) Active friending in online social networks. In: BDCAT 2017, pp 139\u2013148","DOI":"10.1145\/3148055.3148073"},{"key":"560_CR17","unstructured":"Zhang H, Dinh MT, Thai MT (2013) Maximizing the spread of positive inuencein online social networks. In: ICDCS 2013, pp 317\u2013326"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00560-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00560-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00560-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:59:04Z","timestamp":1616115544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00560-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,19]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["560"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00560-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,19]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}