Complexity of Network Reliability and Optimal Resource Placement Problems

DOI10.1137/S0097539792231143MaRDI QIDQ4302281zbMATH OpenOpenAlexFDO

Authors Donald B. Johnson, Larry Raab

Publication date 14 August 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792231143

zbMATH Keywords

rational reliability probabilities

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational Complexity of Network Reliability Analysis: An Overview
• On the computational complexity of reliability redundancy allocation in a series system
• The intractability of the reliable assignment problem in split networks
• The computational complexity of the reliability problem on distributed systems
• scientific article; zbMATH DE number 26483

Cited in

(4)

• The Complexity of the Residual Node Connectedness Reliability Problem
• SOFSEM 2006: Theory and Practice of Computer Science
• Optimal placement of data replicas in distributed database with majority voting protocol
• Resource placement in Cartesian product of networks

This page was built for publication: Complexity of Network Reliability and Optimal Resource Placement Problems

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