{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:07:16Z","timestamp":1743037636598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035352"},{"type":"electronic","value":"9783319035369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_12","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"144-155","source":"Crossref","is-referenced-by-count":1,"title":["An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model"],"prefix":"10.1007","author":[{"given":"Rupei","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"12_CR2","unstructured":"Nail, J.: The Consumer Advertising Backlash. Forrester Research and Intelliseek Market Research Report (May 2004)"},{"key":"12_CR3","unstructured":"Misner, I.R.: The World\u2019s Best Known Marketing Secret: Building Your Business with Word-of-Mouth Marketing, 2nd edn. Bard Press (1999)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable Influence Maximization in Social Networks Under the Linear Threshold Model. In: The 2010 International Conference on Data Mining (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks. In: The 2010 ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"12_CR6","unstructured":"Schelling, T.: Micromotives and Macrobehavior. Norton (1978)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining Knowledge-sharing Sites for Viral Marketing. In: The 2002 International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing The Spread of Influence Through a Social Network. In: The 2003 International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D. Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"12_CR10","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Using Complex Systems Analysis to Advance Marketing Theory Development. Academy of Marketing Science Review (2001)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J. Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the Network:A Complex Systems Look at the Underlying Process of Word-of-Mouth. Marketing Letters\u00a012(3), 211\u2013223 (2001)","journal-title":"Marketing Letters"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M. Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold Models of Collective Behavior. American Journal of Sociology\u00a083(6), 1420\u20131443 (1978)","journal-title":"American Journal of Sociology"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Zou, F., Willson, J., Wu, W.: Fast Information Propagation in Social Networks. In: MDMAA (2010)","DOI":"10.1142\/S1793830910000528"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Lu, Z., Zhang, W., Wu, W., Fu, B., Du, D.Z.: Approximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model. In: 2011 31st International Conference on Distributed Computing Systems Workshops (2011)","DOI":"10.1109\/ICDCSW.2011.33"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Kepner, J., Gilbert, J.: Graph Algorithms in the Language of Linear Algebra, 1st edn. SIAM (2011)","DOI":"10.1137\/1.9780898719918"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective Danamics of \u2018Small-World\u2019 Networks \u00a0393, 440\u2013442 (1998)","DOI":"10.1038\/30918"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kleieberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of 32rd ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0378-4371(99)00291-5","volume":"272","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R., Jeong, H.: Mean-Field Theory for Scale-Free Random Networks. Physica A: Statistical Mechanics and its Applications\u00a0272(1), 173\u2013187 (1999)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"14","key":"12_CR19","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"P.S. Romualdo","year":"2001","unstructured":"Romualdo, P.S., Vespignani, A.: Epidemic spreading in scale-free networks. Physical Review Letters\u00a086(14), 3200\u20133203 (2001)","journal-title":"Physical Review Letters"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Bonato, A.: A Course on the Web Graph, Providence, Rhode Island. American Mathematical Society Graduate Studies Series in Mathematics (2008)","DOI":"10.1090\/gsm\/089"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of on-line social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2006)","DOI":"10.1145\/1150402.1150476"},{"key":"12_CR22","unstructured":"Facebook: statistics, \n                    http:\/\/www.facebook.com\/press\/info.php?statistics\n                   (accessed September 1, 2011)"},{"key":"12_CR23","unstructured":"Twitaholic, \n                    http:\/\/twitaholic.com\/\n                   (accessed September 1, 2011)"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B.K. Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse Approximate Solution to Linear Systems. SIAM Journal on Computing\u00a024, 227\u2013234 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E.J. Cand\u00e9s","year":"2005","unstructured":"Cand\u00e9s, E.J., Tao, T.: Decoding by Linear Programming. IEEE Transaction of Information Theory\u00a051, 4203\u20134215 (2005)","journal-title":"IEEE Transaction of Information Theory"},{"key":"12_CR26","unstructured":"Donoho, D.: For Most Large Underdetermined Systems of Linear Equations the Minimal L\n                        1-norm Solution is Also the Sparsest Solution. Technical Report, Stanford University (2004)"},{"issue":"1","key":"12_CR27","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"A.M. Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Review\u00a051(1), 34\u201381 (2009)","journal-title":"SIAM Review"},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/JPROC.2010.2044010","volume":"98","author":"J.A. Tropp","year":"2010","unstructured":"Tropp, J.A., Wright, S.J.: Computational methods for sparse solution of linear inverse problems. Proceedings of the IEEE\u00a098(6), 948\u2013958 (2010)","journal-title":"Proceedings of the IEEE"},{"key":"12_CR29","unstructured":"Ge, D., Jiang, X. and Ye, Y., A Note on the Complexity of L\n                        \n                  p\n                 Minimization, \n                    http:\/\/www.stanford.edu\/~yyye\/lpmin_v14.pdf"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01581726","volume":"80","author":"Y. Ye","year":"1998","unstructured":"Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Mathematical Programming\u00a080, 195\u2013211 (1998)","journal-title":"Mathematical Programming"},{"key":"12_CR31","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to linear Optimization. Athena Scientific, 414 (1997)"},{"key":"12_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms: theory and analysis","author":"Y. Ye","year":"1997","unstructured":"Ye, Y.: Interior point algorithms: theory and analysis. John Wiley and Sons, Inc., New York (1997)"},{"key":"12_CR33","unstructured":"http:\/\/www.levmuchnik.net\/Content\/Networks\/ComplexNetworksPackage.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:22:33Z","timestamp":1675797753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}