{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:46:17Z","timestamp":1782863177671,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004396","name":"Thailand Research Fund","doi-asserted-by":"publisher","award":["RSA6080029"],"award-info":[{"award-number":["RSA6080029"]}],"id":[{"id":"10.13039\/501100004396","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s00236-026-00541-2","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T22:49:20Z","timestamp":1782859760000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-points cyber defense ($$1+\\epsilon $$) and $$(1+\\epsilon )^{k-k'}$$-approximation"],"prefix":"10.1007","volume":"63","author":[{"given":"Pimukthee","family":"Jaikla","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanpawat","family":"Kantabutra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,30]]},"reference":[{"issue":"3","key":"541_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.14232\/actacyb.22.3.2016.3","volume":"22","author":"G Agnarsson","year":"2016","unstructured":"Agnarsson, G., Greenlaw, R., Kantabutra, S.: On cyber attacks and the maximum-weight rooted-subtree problem. Acta Cybern. 22(3), 591\u2013612 (2016)","journal-title":"Acta Cybern."},{"issue":"4","key":"541_CR2","doi-asserted-by":"publisher","first-page":"735","DOI":"10.14232\/actacyb.22.4.2016.2","volume":"22","author":"G Agnarsson","year":"2016","unstructured":"Agnarsson, G., Greenlaw, R., Kantabutra, S.: The structure of rooted weighted trees modeling layered cyber-security systems. Acta Cybern. 22(4), 735\u2013769 (2016)","journal-title":"Acta Cybern."},{"issue":"2","key":"541_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10845-012-0683-0","volume":"25","author":"A Ahmad","year":"2014","unstructured":"Ahmad, A., Maynard, S.B., Park, S.: Information security strategies: towards an organizational multi-strategy perspective. J. Intell. Manuf. 25(2), 357\u2013370 (2014)","journal-title":"J. Intell. Manuf."},{"key":"541_CR4","unstructured":"Armstrong, R., Mayo, J., Siebenlist, F.: Complexity science challenges in cybersecurity. Sandia National Laboratories SAND Report (2009). https:\/\/sos-vo.org\/sites\/sos-vo.org\/files\/sos_files\/Complexity_Science_Challenges_in_Cybersecurity.pdf"},{"key":"541_CR5","doi-asserted-by":"crossref","unstructured":"Bass, T., Robichaux, R.: Defense-in-depth revisited: qualitative risk analysis methodology for complex network-centric operations. In: MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force, pp. 64\u201370. (2001)","DOI":"10.1109\/MILCOM.2001.985765"},{"key":"541_CR6","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s11590-012-0453-0","volume":"7","author":"M Carvalho","year":"2013","unstructured":"Carvalho, M., Sorokin, A., Boginski, V., Balasundaram, B.: Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7, 695\u2013707 (2013)","journal-title":"Optim. Lett."},{"issue":"3","key":"541_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1002\/net.21469","volume":"61","author":"S Coene","year":"2013","unstructured":"Coene, S., Filippi, C., Spieksma, F.C., Stevanato, E.: Balancing profits and costs on trees. Networks 61(3), 200\u2013211 (2013)","journal-title":"Networks"},{"key":"541_CR8","doi-asserted-by":"publisher","unstructured":"Dewri, R., Poolsappasit, N., Ray, I., Whitley, D.: Optimal security hardening using multi-objective optimization on attack tree models of networks. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS \u201907, pp. 204\u2013213. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1315245.1315272","DOI":"10.1145\/1315245.1315272"},{"key":"541_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0160-y","author":"R Dewri","year":"2012","unstructured":"Dewri, R., Poolsappasit, N., Ray, I., Whitley, D.: Optimal security hardening on attack tree models of networks: a cost benefit analysis. Int. J. Inf. Secur. (2012). https:\/\/doi.org\/10.1007\/s10207-012-0160-y","journal-title":"Int. J. Inf. Secur."},{"key":"541_CR10","unstructured":"Dunlavy, D.M., Hendrickson, B., Kolda, T.G.: Mathematical challenges in cybersecurity. Sandia Report (2009). https:\/\/www.mathsci.ai\/publication\/SAND2009-0805-eco%20Math%20for%20Cyber.pdf"},{"issue":"1\u20133","key":"541_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(99)00125-0","volume":"99","author":"A Hamacher","year":"2000","unstructured":"Hamacher, A., Hochst\u00e4ttler, W., Moll, C.: Tree partitioning under constraints - clustering for vehicle routing problems. Discret. Appl. Math. 99(1\u20133), 55\u201369 (2000)","journal-title":"Discret. Appl. Math."},{"key":"541_CR12","doi-asserted-by":"crossref","unstructured":"Hsieh, S.Y., Chou, T.Y.: Finding a weight-constrained maximum-density subtree in a tree. In: International Symposium on Algorithms and Computation, pp. 944\u2013953. Springer (2005)","DOI":"10.1007\/11602613_94"},{"issue":"1","key":"541_CR13","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/COMST.2018.2871866","volume":"21","author":"M Hus\u00e1k","year":"2019","unstructured":"Hus\u00e1k, M., Kom\u00e1rkov\u00e1, J., Bou-Harb, E., \u010celeda, P.: Survey of attack projection, prediction, and forecasting in cyber security. IEEE Commun. Surv. Tutor. 21(1), 640\u2013660 (2019)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1","key":"541_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.8.1.1","volume":"8","author":"DS Johnson","year":"1983","unstructured":"Johnson, D.S., Niemi, K.: On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8(1), 1\u201314 (1983)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"541_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.disopt.2006.06.002","volume":"3","author":"HC Lau","year":"2006","unstructured":"Lau, H.C., Ngo, T.H., Nguyen, B.N.: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics. Discret. Optim. 3(4), 385\u2013391 (2006)","journal-title":"Discret. Optim."},{"key":"541_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Alderson, D., Willinger, W., Doyle, J.: A first-principles approach to understanding the internet\u2019s router-level topology. In: ACM SIGCOMM Conference, pp. 3\u201314. ACM (2004)","DOI":"10.1145\/1015467.1015470"},{"key":"541_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-02786-9_13","volume":"8252","author":"W Lu","year":"2013","unstructured":"Lu, W., Xu, S., Yi, X.: Optimizing active cyber defense. Lect. Notes Comput. Sci. 8252, 206\u2013225 (2013)","journal-title":"Lect. Notes Comput. Sci."},{"key":"541_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jcss.2020.07.001","volume":"115","author":"S Mukdasanit","year":"2021","unstructured":"Mukdasanit, S., Kantabutra, S.: Attack and defense in the layered cyber-security model and their ($$1\\pm \\epsilon $$)-approximation schemes. J. Comput. Syst. Sci. 115, 54\u201363 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"541_CR19","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s11590-016-1044-2","volume":"11","author":"H Nguyen","year":"2017","unstructured":"Nguyen, H., Sharkey, T.: A computational approach to determine damage in infrastructure networks from outage reports. Optim. Lett. 11, 753\u2013770 (2017)","journal-title":"Optim. Lett."},{"key":"541_CR20","doi-asserted-by":"crossref","unstructured":"Okimoto, T., Ikegai, N., Inoue, K., Okada, H., Ribeiro, T., Maruyama, H.: Cyber security problem based on multi-objective distributed constraint optimization technique. In: the 43rd Annual IEEE\/IFIP Conference on Dependable Systems and Networks Workshop, pp. 1\u20137. IEEE (2013)","DOI":"10.1109\/DSNW.2013.6615540"},{"key":"541_CR21","unstructured":"Schneider, F.B.: Blueprint for a science of cybersecurity. Tech. Rep. (2011). https:\/\/www.cs.cornell.edu\/fbs\/publications\/SoS.blueprint.pdf"},{"issue":"2","key":"541_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2008.09.027","volume":"109","author":"HH Su","year":"2008","unstructured":"Su, H.H., Lu, C.L., Tang, C.Y.: An improved algorithm for finding a length-constrained maximum-density subtree in a tree. Inf. Process. Lett. 109(2), 161\u2013164 (2008)","journal-title":"Inf. Process. Lett."},{"key":"541_CR23","first-page":"85","volume":"449","author":"K Vamvoudakis","year":"2013","unstructured":"Vamvoudakis, K., Hespanha, J., Kemmerer, R., Vigna, G.: Formulating cyber-security as convex optimization problems. Lect. Notes Control Inf. Sci. 449, 85\u2013100 (2013)","journal-title":"Lect. Notes Control Inf. Sci."},{"key":"541_CR24","doi-asserted-by":"publisher","first-page":"8599","DOI":"10.1109\/ACCESS.2018.2805690","volume":"6","author":"H Wang","year":"2018","unstructured":"Wang, H., Chen, Z., Zhao, J., Di, X., Liu, D.: A vulnerability assessment method in industrial internet of things based on attack graph and maximum flow. IEEE Access 6, 8599\u20138609 (2018)","journal-title":"IEEE Access"},{"issue":"2","key":"541_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"issue":"11","key":"541_CR26","doi-asserted-by":"publisher","first-page":"3401","DOI":"10.1587\/transcom.E92.B.3401","volume":"92\u2013B","author":"K Woradit","year":"2009","unstructured":"Woradit, K., Guyot, M., Vanichchanunt, P., Saengudomlert, P., Wuttisittikulkij, L.: Multicast routing and wavelength assignment with shared protection in multi-fiber wdm mesh networks: Optimal and heuristic solutions. IEICE Trans. Commun. 92\u2013B(11), 3401\u20133409 (2009)","journal-title":"IEICE Trans. Commun."},{"key":"541_CR27","doi-asserted-by":"publisher","first-page":"9998","DOI":"10.1109\/ACCESS.2019.2891613","volume":"7","author":"XL Xiong","year":"2019","unstructured":"Xiong, X.L., Yang, L., Zhao, G.S.: Effectiveness evaluation model of moving target defense based on system attack surface. IEEE Access 7, 9998\u201310014 (2019)","journal-title":"IEEE Access"},{"key":"541_CR28","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s11590-019-01465-2","volume":"14","author":"G Xu","year":"2020","unstructured":"Xu, G., Semenov, A., Rysz, M.: An integer programming formulation of the key management problem in wireless sensor networks. Optim. Lett. 14, 1037\u20131051 (2020)","journal-title":"Optim. Lett."},{"key":"541_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10796-021-10134-8","volume":"23","author":"S Xu","year":"2021","unstructured":"Xu, S., Yung, M., Wang, J.: Seeking foundations for the science of cyber security. Inf. Syst. Front. 23, 263\u2013267 (2021)","journal-title":"Inf. Syst. Front."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00541-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00541-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00541-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T22:49:30Z","timestamp":1782859770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00541-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,30]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00541-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,30]]},"assertion":[{"value":"29 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"24"}}