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

DOI10.1016/j.jcss.2020.07.001zbMath1464.68044OpenAlexW3044160555WikidataQ115041714 ScholiaQ115041714MaRDI QIDQ2208245

Sanpawat Kantabutra, Supachai Mukdasanit

Publication date: 23 October 2020

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2020.07.001

zbMATH Keywords

complexityalgorithmsgraph theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Computer security (68M25)

Cites Work

• Unnamed Item
• Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
• An improved algorithm for finding a length-constrained maximum-density subtree in a tree
• Deterministic network interdiction
• Tree partitioning under constraints. -- Clustering for vehicle routing problems
• On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem
• The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Balancing profits and costs on trees
• Algorithms and Computation
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes