不确定条件下的可达性
Reachability Under Uncertainty
摘要：
在本文中，我们引入了一个新的网络可达性问题，其目标是找到最可靠的路径在网络中的两个节点之间，表示为一个有向无环图。该网络内的各个边可能根据某些概率而失效，并且这些失效概率可能取决于一个或多个隐变量的值。这个问题可以看作是寻找最小成本路径的最短路径问题或寻找最高概率状态序列的维特比型问题的推广，其中添加隐藏变量引入了以前算法无法处理的相关性。我们给出了表征这个问题的理论结果，包括NP-硬度证明。我们还给出了该问题的一个精确算法和一个更有效的近似算法。
英文摘要：
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according to certain probabilities, and these failure probabilities may depend on the values of one or more hidden variables. This problem may be viewed as a generalization of shortest-path problems for finding minimum cost paths or Viterbi-type problems for finding highest-probability sequences of states, where the addition of the hidden variables introduces correlations that are not handled by previous algorithms. We give theoretical results characterizing this problem including an NP-hardness proof. We also give an exact algorithm and a more efficient approximation algorithm for this problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
