On the inapproximability of minimizing cascading failures under the deterministic threshold model
Lists
Only you see this
Abstract
Highlights•We formulate the cascading failure minimization problem.•We prove an n1−ϵ<math><msup is="true"><mrow is="true"><mi is="true">n</mi></mrow><mrow is="true"><mn is="true">1</mn><mo is="true">−</mo><mi is="true">ϵ</mi></mrow></msup></math> inapproximability result for the general case.•We prove a 12nϵ<math><mfrac is="true"><mn is="true">1</mn><mn is="true">2</mn></mfrac><msup is="true"><mrow is="true"><mi is="true">n</mi></mrow><mrow is="true"><mi is="true">ϵ</mi></mrow></msup></math> inapproximability result when the maximum threshold is 1.
BibTeX
@article{nie2014inapproximability,
author = {Lei Nie and Jingjie Liu and Haicang Zhang and Zhiwei Xu},
title = {{On the inapproximability of minimizing cascading failures under the deterministic threshold model}},
journal = {Inf. Process. Lett.},
year = {2014},
doi = {10.1016/j.ipl.2013.10.007},
}Loading related content...