{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T12:37:30Z","timestamp":1723466250247},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T00:00:00Z","timestamp":1370736000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9635-7","type":"journal-article","created":{"date-parts":[[2013,6,8]],"date-time":"2013-06-08T11:14:34Z","timestamp":1370690074000},"page":"97-108","source":"Crossref","is-referenced-by-count":23,"title":["Better approximation algorithms for influence maximization in online social networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuqing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yuanjun","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yiwei","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Wen","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,9]]},"reference":[{"key":"9635_CR1","doi-asserted-by":"crossref","unstructured":"Austrin P, Benabbas S, Georgiouy K (2013) Better balance by being biased: a 0.8776-approximation for max bisection. In: Proceedings of SODA","DOI":"10.1137\/1.9781611973105.21"},{"key":"9635_CR2","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD, Paris, France, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"9635_CR3","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010a) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE international conference on data mining","DOI":"10.1109\/ICDM.2010.118"},{"key":"9635_CR4","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010b) Scalable influence maximization for prevalent viral marketing in large scale social networks. In: KDD, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"9635_CR5","unstructured":"CVX Research, Inc (2012) CVX: Matlab software for disciplined convex programming. http:\/\/cvxr.com\/cvx . Accessed September 2012"},{"key":"9635_CR6","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"9635_CR7","unstructured":"Feige U, Goemans M (1995) Approximating the value of two prover proof systems with applications to MAX 2SAT and MAX DICUT"},{"key":"9635_CR8","doi-asserted-by":"crossref","unstructured":"Feige U, Lovasz L (1992) Two-prover one-round proof systems: their power and their problems. In: Proceedings of the 24th annual ACM symposium on the theory of computing, pp 733\u2013744","DOI":"10.1145\/129712.129783"},{"key":"9635_CR9","doi-asserted-by":"crossref","unstructured":"Geomans M, Williamson D (1994) 879-Approximation algorithms for MAX CUT and MAX 2SAT. In: Proceedings of the twenty-sixth annual ACM symposium on theory of computing, pp 422\u2013431","DOI":"10.1145\/195058.195216"},{"key":"9635_CR10","unstructured":"He X, Song G, Chen W, Jiang Q (2011) Influence blocking maximization in social networks under the competitive linear threshold model. Technical Report. CoRR, abs\/1110.4723"},{"key":"9635_CR11","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: KDD","DOI":"10.1145\/956750.956769"},{"issue":"3","key":"9635_CR12","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"B Lasserre","year":"2002","unstructured":"Lasserre B (2002) An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM J Optim 12(3):756\u2013769","journal-title":"SIAM J Optim"},{"key":"9635_CR13","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: KDD, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"9635_CR14","doi-asserted-by":"crossref","unstructured":"Wu C, Du D, Xu D (2013) An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. In: COCOON","DOI":"10.1007\/978-3-642-38768-5_28"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9635-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9635-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9635-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9635-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9635"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9635-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,9]]}}}