容错最短路径-超越统一故障模型
Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model
摘要：
绝大多数可生存（容错）网络设计模型假设一个统一的场景集。这样的场景集合假设给定基数$k$的网络资源（边或顶点）的每个子集包括场景。虽然这种方法产生了干净的组合结构和良好的算法的问题，但它通常无法捕捉来自应用程序的场景集的真实性质。统一模型的一个自然细化是通过将资源集划分为故障资源和安全资源来获得的。方案集包含至多$k$故障资源的每个子集。这项工作研究的容错路径（FTP）的问题，对应的最短路径问题，在这个故障模型。我们提出了复杂性的结果，以及精确和近似算法FTP。我们强调的巨大增加的问题的复杂性，其统一的模拟，边缘不相交的路径问题。
英文摘要：
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform scenario set. Such a scenario set assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ comprises a scenario. While this approach yields problems with clean combinatorial structure and good algorithms, it often fails to capture the true nature of the scenario set coming from applications. One natural refinement of the uniform model is obtained by partitioning the set of resources into faulty and secure resources. The scenario set contains every subset of at most $k$ faulty resources. This work studies the Fault-Tolerant Path (FTP) problem, the counterpart of the Shortest Path problem in this failure model. We present complexity results alongside exact and approximation algorithms for FTP. We emphasize the vast increase in the complexity of the problem with respect to its uniform analogue, the Edge-Disjoint Paths problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
