On the inapproximability of minimizing cascading failures under the deterministic threshold model

DOI10.1016/j.ipl.2013.10.007zbMath1330.05152OpenAlexW2060286335MaRDI QIDQ2350582

Zhiwei Xu, Haicang Zhang, Jingjie Liu, Lei Nie

Publication date: 25 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.10.007

zbMATH Keywords

combinatorial problemsinapproximabilitycascading failuresdeterministic threshold model

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Algorithms for optimal replica placement under correlated failure in hierarchical failure domains

Cites Work

• Inoculation strategies for victims of viruses and the sum-of-squares partition problem
• A Stab at Approximating Minimum Subadditive Join
• Algorithms – ESA 2005
• Which Networks are Least Susceptible to Cascading Failures?

This page was built for publication: On the inapproximability of minimizing cascading failures under the deterministic threshold model