Optimal serverless networks attacks, complexity and some approximate algorithms

MaRDI QIDQ4929332zbMATH OpenFDO

Authors

Publication date 22 September 2010

Full work available at URL http://www.jucs.org/jucs_15_14/optimal_serverless_networks_attacks

zbMATH Keywords

attack strategiesnetwork connectivityNP-completeoptimal attack problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Minimizing expected attacking cost in networks
• Optimal attack and reinforcement of a network
• Optimal attack strategy of complex networks based on tabu search
• Approximability of the k‐server disconnection problem
• Two-Server Network Disconnection Problem

Cited in

(7)

• Optimal attack strategy of complex networks based on tabu search
• Minimizing expected attacking cost in networks
• Optimal inspection points for malicious attack detection in smart grids
• Two-Server Network Disconnection Problem
• Measuring the impact of MVC attack in large complex networks
• Approximability of the k‐server disconnection problem
• Min–max optimization of node‐targeted attacks in service networks

This page was built for publication: Optimal serverless networks attacks, complexity and some approximate algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929332)