Scholarlink

<p>In this paper, we mainly investigate the fault-tolerant knapsack center problem and propose a tight 3-approximation algorithm for it. This problem covers several classical variants of the center problem, including the <i>k</i>-center problem, the knapsack center problem and the fault-tolerant <i>k</i>-center problem. In addition, we also provide a (3,&#xa0;1)-approximation algorithm for the distance-constrained fault-tolerant facility location problem. Our findings generalize the relevant results in Chen et al. (Algorithmica 75:27–52, 2016), Khuller et al. (Theor Comput Sci 242:237–245, 2000), and Li et al. (Inf Process Lett 184:106447, 2024).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Approximation algorithm for the fault-tolerant knapsack center problem

  • 期刊论文

  • 发表日期：

    2026年5月19日

查看全文
  • Runjie Miao

摘要

In this paper, we mainly investigate the fault-tolerant knapsack center problem and propose a tight 3-approximation algorithm for it. This problem covers several classical variants of the center problem, including the k-center problem, the knapsack center problem and the fault-tolerant k-center problem. In addition, we also provide a (3, 1)-approximation algorithm for the distance-constrained fault-tolerant facility location problem. Our findings generalize the relevant results in Chen et al. (Algorithmica 75:27–52, 2016), Khuller et al. (Theor Comput Sci 242:237–245, 2000), and Li et al. (Inf Process Lett 184:106447, 2024).