On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem

DOI10.14232/actacyb.22.3.2016.3zbMath1363.68010OpenAlexW2345368607MaRDI QIDQ2820783

Raymond Greenlawy, Sanpawat Kantabutra, Geir Agnarsson

Publication date: 9 September 2016

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.22.3.2016.3

zbMATH Keywords

complexitypolynomial timeinformation securitycyber securitypseudo-polynomial timedefense-in-depthgame overlayered securityweighted rooted trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Data encryption (aspects in computer science) (68P25) Internet topics (68M11)

Related Items (1)

Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes

This page was built for publication: On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem