{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:20Z","timestamp":1774418120717,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,11]],"date-time":"2012-07-11T00:00:00Z","timestamp":1341964800000},"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":[[2014,4]]},"DOI":"10.1007\/s10878-012-9530-7","type":"journal-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T19:02:45Z","timestamp":1341946965000},"page":"487-503","source":"Crossref","is-referenced-by-count":53,"title":["On the approximability of positive influence dominating set in social networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Thang N.","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Yilin","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Dung T.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,11]]},"reference":[{"key":"9530_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/335305.335326","volume-title":"STOC \u201900","author":"W Aiello","year":"2000","unstructured":"Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: STOC \u201900. ACM, New York, pp 171\u2013180. http:\/\/doi.acm.org\/10.1145\/335305.335326"},{"key":"9530_CR2","first-page":"192","volume-title":"ESA\u201904","author":"M Chleb\u00edk","year":"2004","unstructured":"Chleb\u00edk M, Chleb\u00edkov\u00e1 J (2004) Approximation hardness of dominating set problems. In: ESA\u201904, pp.\u00a0192\u2013203"},{"key":"9530_CR3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-642-22953-4_25","volume-title":"Proceedings of the 18th international conference on fundamentals of computation theory, FCT\u201911","author":"F Cicalese","year":"2011","unstructured":"Cicalese F, Milani\u010d M, Vaccaro U (2011) Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Proceedings of the 18th international conference on fundamentals of computation theory, FCT\u201911. Springer, Berlin, pp 288\u2013297. http:\/\/dl.acm.org\/citation.cfm?id=2034214.2034239"},{"key":"9530_CR4","volume-title":"Proceedings of the 23rd ACM conference on hypertext and social media, HT \u201912","author":"TN Dinh","year":"2012","unstructured":"Dinh TN, Dung NT, Thai MT (2012) Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: Proceedings of the 23rd ACM conference on hypertext and social media, HT \u201912. ACM, Milwaukee"},{"key":"9530_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/502512.502525","volume-title":"KDD \u201901","author":"P Domingos","year":"2001","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD \u201901. ACM, New York, pp 57\u201366. http:\/\/doi.acm.org\/10.1145\/502512.502525"},{"issue":"4","key":"9530_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45(4):634\u2013652. http:\/\/doi.acm.org\/10.1145\/285055.285059","journal-title":"J ACM"},{"issue":"1\u20133","key":"9530_CR7","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.tcs.2007.12.007","volume":"393","author":"A Ferrante","year":"2008","unstructured":"Ferrante A, Pandurangan G, Park K (2008) On the hardness of optimization in power-law graphs. Theor Comput Sci 393(1\u20133):220\u2013230. http:\/\/dx.doi.org\/10.1016\/j.tcs.2007.12.007","journal-title":"Theor Comput Sci"},{"issue":"12","key":"9530_CR8","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821\u20137826. doi: 10.1073\/pnas.122653799 . http:\/\/dx.doi.org\/10.1073\/pnas.122653799","journal-title":"Proc Natl Acad Sci USA"},{"key":"9530_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/781027.781046","volume-title":"SIGMETRICS \u201903","author":"C Gkantsidis","year":"2003","unstructured":"Gkantsidis C, Mihail M, Saberi A (2003) Conductance and congestion in power law graphs. In: SIGMETRICS \u201903. ACM, New York, pp 148\u2013159. http:\/\/doi.acm.org\/10.1145\/781027.781046"},{"issue":"3","key":"9530_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.jadohealth.2004.08.014","volume":"37","author":"KG Hill","year":"2005","unstructured":"Hill KG, Hawkins JD, Catalano RF, Abbott RD, Guo J (2005) Family influences on the risk of daily smoking initiation. J Adolescent Health 37(3):202\u2013210. http:\/\/www.sciencedirect.com\/science\/article\/B6T80-4GWPPTF-5\/2\/3548286c9c2228ce3c7afaa4db17830c","journal-title":"J Adolescent Health"},{"key":"9530_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"KDD\u201903","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9. (2003) Maximizing the spread of influence through a social network. In: KDD\u201903. ACM, New York, pp 137\u2013146"},{"key":"9530_CR12","first-page":"1127","volume-title":"ICALP\u201905","author":"D Kempe","year":"2005","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. In: ICALP\u201905. pp 1127\u20131138"},{"key":"9530_CR13","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/1281192.1281239","volume-title":"KDD \u201907","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: KDD \u201907. ACM, New York, pp 420\u2013429. http:\/\/doi.acm.org\/10.1145\/1281192.1281239"},{"key":"9530_CR14","first-page":"322","volume-title":"STOC \u201993","author":"S Rajagopalan","year":"1993","unstructured":"Rajagopalan S, Vazirani VV (1993) Primal-dual rnc approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In: STOC \u201993. IEEE Comput Soc, Washington, pp 322\u2013331. http:\/\/dx.doi.org\/10.1109\/SFCS.1993.366855"},{"key":"9530_CR15","volume-title":"IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM)","author":"P Shakarian","year":"2012","unstructured":"Shakarian P, Paulo D (2012) Large social networks can be targeted for viral marketing with small seed sets. In: IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM)"},{"key":"9530_CR16","unstructured":"Standridge JB, Zylstra RG, Adams SM (2004) Alcohol consumption: an overview of benefits and risks. Southern Med J. http:\/\/journals.lww.com\/smajournalonline\/Fulltext\/2004\/07000\/Alcohol_Consumption__An_Overview_of_Benefits_and.12.aspx"},{"key":"9530_CR17","first-page":"453","volume-title":"ACM symposium on theory of computing \u201901","author":"L Trevisan","year":"2001","unstructured":"Trevisan L (2001) Non-approximability results for optimization problems on bounded degree instances. In: ACM symposium on theory of computing \u201901. ACM, New York, pp 453\u2013461. http:\/\/doi.acm.org\/10.1145\/380752.380839"},{"key":"9530_CR18","first-page":"313","volume-title":"COCOA \u201909","author":"F Wang","year":"2009","unstructured":"Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. In: COCOA \u201909. Springer, Berlin, pp 313\u2013321. http:\/\/dx.doi.org\/10.1007\/978-3-642-02026-1_29 ."},{"key":"9530_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/978-3-642-03417-6_51","volume-title":"WASA","author":"F Zou","year":"2009","unstructured":"Zou F, Zhang Z, Wu W (2009) Latency-bounded minimum influential node selection in social networks. In: Liu B, Bestavros A, Du DZ, Wang J (eds) WASA. Lecture notes in computer science, pp 519\u2013526. http:\/\/dx.doi.org\/10.1007\/978-3-642-03417-6_51"},{"key":"9530_CR20","doi-asserted-by":"crossref","unstructured":"Zhang W, Zhang Z, Wang W, Zou F, Lee W (2010) Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. Journal of Combinatorial Optimization, 1\u201311. http:\/\/dx.doi.org\/10.1007\/s10878-010-9359-x","DOI":"10.1007\/s10878-010-9359-x"},{"key":"9530_CR21","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s10898-009-9511-2","volume":"48","author":"X Zhu","year":"2010","unstructured":"Zhu X, Yu J, Lee W, Kim D, Shan S, Du DZ (2010) New dominating sets in social networks. J Glob Optim 48:633\u2013642. http:\/\/dx.doi.org\/10.1007\/s10898-009-9511-2","journal-title":"J Glob Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9530-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9530-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9530-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T06:12:21Z","timestamp":1687587141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9530-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9530"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9530-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,11]]}}}