{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:25Z","timestamp":1761621145733},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T00:00:00Z","timestamp":1378512000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10589-013-9589-9","type":"journal-article","created":{"date-parts":[[2013,9,6]],"date-time":"2013-09-06T15:30:12Z","timestamp":1378481412000},"page":"71-104","source":"Crossref","is-referenced-by-count":19,"title":["A cutting-plane algorithm for solving a weighted influence interdiction problem"],"prefix":"10.1007","volume":"57","author":[{"given":"Mehdi","family":"Hemmati","sequence":"first","affiliation":[]},{"given":"J.","family":"Cole Smith","sequence":"additional","affiliation":[]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,7]]},"reference":[{"key":"9589_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"9589_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/0-387-23830-1_8","volume-title":"Handbook of Combinatorial Optimization Supplement Volume B","author":"J. Blum","year":"2005","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Du, D., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization Supplement Volume B, pp. 329\u2013369. Springer, Berlin (2005)"},{"key":"9589_CR3","first-page":"102","volume-title":"Tutorials in Operations Research: Emerging Theory, Methods, and Applications","author":"G.G. Brown","year":"2005","unstructured":"Brown, G.G., Carlyle, W.M., Salmer\u00f3n, J., Wood, K.: Analyzing the vulnerability of critical infrastructure to attack and planning defenses. In: Greenberg, H.J., Smith, J.C. (eds.) Tutorials in Operations Research: Emerging Theory, Methods, and Applications, pp. 102\u2013123. INFORMS, Hanover (2005)"},{"issue":"6","key":"9589_CR4","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"G.G. Brown","year":"2006","unstructured":"Brown, G.G., Carlyle, W.M., Salmer\u00f3n, J., Wood, K.: Defending critical infrastructure. Interfaces 36(6), 530\u2013544 (2006)","journal-title":"Interfaces"},{"key":"9589_CR5","volume-title":"Proceedings of the Twentieth International Conference on World Wide Web","author":"C. Budak","year":"2011","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the Twentieth International Conference on World Wide Web. ACM, New York (2011)"},{"issue":"3","key":"9589_CR6","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N. Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"9589_CR7","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","volume-title":"Complex Graphs and Networks","author":"F.R.K. Chung","year":"2006","unstructured":"Chung, F.R.K., Lu, L.: Complex Graphs and Networks. Am. Math. Soc., Providence (2006)"},{"key":"9589_CR8","first-page":"165","volume-title":"Proceedings of the Twenty Third ACM Conference on Hypertext and Social Media","author":"T.N. Dinh","year":"2012","unstructured":"Dinh, T.N., Nguyen, D.T., Thai, M.T.: Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: Proceedings of the Twenty Third ACM Conference on Hypertext and Social Media, pp. 165\u2013174. ACM, New York (2012)"},{"key":"9589_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, Princeton (1979)"},{"key":"9589_CR10","doi-asserted-by":"crossref","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\u00a0complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12, 211\u2013223 (2001)","journal-title":"Mark. Lett."},{"key":"9589_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/11537311_16","volume-title":"Fundamentals of Computation Theory","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Raible, D.: Improved algorithms and complexity results for power domination in graphs. In: Liskiewicz, M., Reischuk, R. (eds.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 3623, pp. 172\u2013184. Springer, Berlin (2005)"},{"key":"9589_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D. Kempe","year":"2003","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, New York (2003)"},{"key":"9589_CR13","first-page":"420","volume-title":"Proceedings of the Thirteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Leskovec","year":"2007","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the Thirteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429. ACM, New York (2007)"},{"key":"9589_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of the approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"9589_CR15","volume-title":"Proceedings of the Fourth ACM Web Science","author":"N.P. Nguyen","year":"2012","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: Proceedings of the Fourth ACM Web Science (2012)"},{"key":"9589_CR16","first-page":"38","volume-title":"Proceedings of the Third International Workshop on Mathematical Models, Architectures and Protocols for Computer Network Security (MMM-ACNS)","author":"D. Nicol","year":"2005","unstructured":"Nicol, D., Liljenstam, M.: Models and analysis of active worm defense. In: Proceedings of the Third International Workshop on Mathematical Models, Architectures and Protocols for Computer Network Security (MMM-ACNS), pp. 38\u201353 (2005)"},{"key":"9589_CR17","first-page":"1470","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"S. Shen","year":"2011","unstructured":"Shen, S.: Domination problems. In: Cochran, J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, pp. 1470\u20131488. Wiley, Hoboken (2011)"},{"issue":"3","key":"9589_CR18","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S. Shen","year":"2012","unstructured":"Shen, S., Smith, J.C., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optim. 9(3), 172\u2013188 (2012)","journal-title":"Discrete Optim."},{"key":"9589_CR19","volume-title":"ACM International Conference on Information and Knowledge Management (CIKM)","author":"Y. Shen","year":"2012","unstructured":"Shen, Y., Dinh, T.N., Zhang, H., Thai, M.T.: Interest-matching information propagation in online social networks. In: ACM International Conference on Information and Knowledge Management (CIKM) (2012)"},{"key":"9589_CR20","first-page":"323","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"J.C. Smith","year":"2011","unstructured":"Smith, J.C.: Basic interdiction models. In: Cochran, J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, pp. 323\u2013330. Wiley, Hoboken (2011)"},{"key":"9589_CR21","series-title":"Nonconvex Optimization and Its Applications Series","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-0-387-77247-9_24","volume-title":"Pareto Optimality, Game Theory and Equilibria","author":"J.C. Smith","year":"2008","unstructured":"Smith, J.C., Lim, C.: Algorithms for network interdiction and fortification games. In: Migdalas, A., Pardalos, P.M., Pitsoulis, L., Chinchuluun, A. (eds.) Pareto Optimality, Game Theory and Equilibria. Nonconvex Optimization and Its Applications Series, pp. 609\u2013644. Springer, New York (2008)"},{"issue":"7","key":"9589_CR22","doi-asserted-by":"crossref","first-page":"1414","DOI":"10.1016\/j.adhoc.2009.02.004","volume":"7","author":"S. Tanachaiwiwat","year":"2009","unstructured":"Tanachaiwiwat, S., Helmy, A.: Encounter-based worms: analysis and defense. Ad Hoc Netw. 7(7), 1414\u20131430 (2009)","journal-title":"Ad Hoc Netw."},{"key":"9589_CR23","volume-title":"The Theory of the Market Economy","author":"H. Stackelberg von","year":"1952","unstructured":"von Stackelberg, H.: The Theory of the Market Economy. William Hodge & Co., London (1952)"},{"issue":"2","key":"9589_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"issue":"8","key":"9589_CR25","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TPDS.2006.103","volume":"17","author":"J. Wu","year":"2006","unstructured":"Wu, J., Cardei, M., Dai, F., Yang, S.: Extended dominating set and its applications in ad hoc networks using cooperative communication. IEEE Trans. Parallel Distrib. Syst. 17(8), 851\u2013864 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"15","key":"9589_CR26","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.disc.2006.03.037","volume":"306","author":"M. Zhao","year":"2006","unstructured":"Zhao, M., Kang, L., Chang, G.J.: Power domination in graphs. Discrete Math. 306(15), 1812\u20131816 (2006)","journal-title":"Discrete Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9589-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9589-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9589-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:35Z","timestamp":1559241455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9589-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9589"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9589-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,7]]}}}