具有次可加成本的顺序测试
Sequential Testing with Subadditive Costs
AI总结:
研究次可加成本下的顺序测试问题,提出基于截断的$(4ρ+γ)$-近似算法,并给出树成本、路由成本和机器激活成本等多种应用下的首个近似算法及次模成本下的不可近似性结果。
摘要:
在经典的顺序测试问题中,给定一个包含多个组件的系统,每个组件以一定的独立概率失效。目标是识别是否有组件失效。当测试成本是可加的时,众所周知,贪心算法能找到最优解。我们考虑了一个更一般的具有次可加成本函数的设定,并提供了一个$(4ρ+γ)$-近似算法,假设存在一个$γ$-近似的值预言机(计算任意子集的成本)和一个$ρ$-近似的比率预言机(寻找成本与失效概率比率最小的子集)。虽然自然的贪心算法在次可加情况下近似比很差,但我们证明了适当的截断可以实现上述保证。我们的分析基于与最小和集合覆盖问题的联系。作为应用,我们获得了各种成本结构下顺序测试的首个近似算法:基于树成本的$(5+ε)$-近似,路由成本的$9.5$-近似,以及机器激活成本的$(4+\ln n)$-近似。我们还证明了在次模成本下的顺序测试不存在任何对数近似(假设指数时间假设成立)。
英文摘要:
In the classic sequential testing problem, we are given a system with several components each of which fails with some independent probability. The goal is to identify whether or not some component has failed. When the test costs are additive, it is well known that a greedy algorithm finds an optimal solution. We consider a much more general setting with subadditive cost functions and provide a $(4ρ+γ)$-approximation algorithm, assuming a $γ$-approximate value oracle (that computes the cost of any subset) and a $ρ$-approximate ratio oracle (that finds a subset with minimum ratio of cost to failure probability). While the natural greedy algorithm has a poor approximation ratio in the subadditive case, we show that a suitable truncation achieves the above guarantee. Our analysis is based on a connection to the minimum sum set cover problem. As applications, we obtain the first approximation algorithms for sequential testing under various cost-structures: $(5+ε)$-approximation for tree-based costs, $9.5$-approximation for routing costs and $(4+\ln n)$ for machine activation costs. We also show that sequential testing under submodular costs does not admit any poly-logarithmic approximation (assuming the exponential time hypothesis).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。