首页> 外文会议>International computing and combinatorics conference >An Approximation Framework for Bounded Facility Location Problems
【24h】

An Approximation Framework for Bounded Facility Location Problems

机译:有界设施位置问题的近似框架

获取原文

摘要

We study the bounded metric uncapacitated facility location (bUFL) problem and its two variants, the bounded fault-tolerant facility location (bFTFL) problem and the bounded fault-tolerant facility placement (bFTFP) problem. We propose a unified approximation framework built on the state-of-the-art approximation algorithms for the three unbounded counterparts, leading to a (2.488+∈)-approximation algorithm for the bUFL problem in the Euclidean plane, a (1.488+H(n))-approximation algorithm for the bUFL problem, a (1.725 + H(n))-approximation algorithm for the bFTFL problem, and a (1.515 + H(n))-approximation algorithm for the bFTFP problem in a general metric space. We also prove an inapproximability result for all the three bounded facility location problems in a general metric space.
机译:我们研究了有界度量无能力设施位置(bUFL)问题及其两个变体,有界容错设施位置(bFTFL)问题和有界容错设施位置(bFTFP)问题。我们针对三个无界对应物提出了一种基于最新近似算法的统一近似框架,从而为欧几里德平面上的bUFL问题提出了一种(2.488 +ε)-近似算法,(1.488 + H(一般度量空间中的bUFL问题的n))逼近算法,bFTFL问题的(1.725 + H(n))逼近算法和bFTFP问题的(1.515 + H(n))逼近算法。我们还证明了一般度量空间中所有三个有界设施位置问题的不可逼近结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号