The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem

Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra

In our cyber security model we define the concept of {\em penetration cost}, which is the cost that must be paid in order to break into the next layer of security. Given a tree $T$…