0397466 20240103203114.320140618235959.9 000334087400005 10.1016/j.ijar.2013.07.003 12 s. P cav_un_epca*02567740888-613X554 (2014)977-988Elsevier Decision-theoretic troubleshooting Hardness of approximation NP-completeness cav_un_auth*0272969 Lín Václav Matematická teorie rozhodování Department of Decision Making Theory MTR MTR UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. GA13-20012S GA ČR cav_un_auth*0292670 Decision-theoretic troubleshooting is one of the areas to which Bayesian networks can be applied. Given a probabilistic model of a malfunctioning man-made device, the task is to construct a repair strategy with minimal expected cost. The problem has received considerable attention over the past two decades. Efficient solution algorithms have been found for simple cases, whereas other variants have been proven NP-complete. We study several variants of the problem found in literature, and prove that computing approximate troubleshooting strategies is NP-hard. In the proofs, we exploit a close connection to set-covering problems. 2015 BB RVO:67985556 http://hdl.handle.net/11104/0225901 S COMPUTERSCIENCEARTIFICIALINTELLIGENCE 0.683 1.460 Q1 58.39 81.707 Q2 Q1 2014 000334087400005 WOS cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 55 č. 4 2014 977 988 Elsevier