Improved approximation algorithms for the robust fault-tolerant facility location problem

  • Authors:

  • Yu Li;Dachuan Xu;Donglei Du;Naihua Xiu

  • Affiliations:

  • Department of Mathematics, School of Science, Beijing Jiaotong University, Beijing 100044, PR China;Department of Applied Mathematics, Beijing University of Technology, Beijing 100124, PR China;Faculty of Business Administration, University of New Brunswick, Fredericton, NB, E3B 5A3, Canada;Department of Mathematics, School of Science, Beijing Jiaotong University, Beijing 100044, PR China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2012

Quantified Score

Hi-index 0.89

Visualization

Abstract

We consider the robust @a fault-tolerant facility location problem (@a-RFLP), recently introduced by Chechik and Peleg (2010) [6]. We present an improved approximation algorithm with ratio 5.236 for the 1-RFLP comparing to 6.5 by Chechik and Peleg@?s. For the general @a-RFLP (fixed @a=2), the same algorithm with a different subroutine tailored for @a=2 provides an improved approximation ratio 1.005+6.015@a comparing to 1.5+7.5@a by Chechik and Peleg@?s. The key component of our algorithm is the resolution of an auxiliary facility location problem (FLP) by a variant of the LP-rounding technique of Byrka and Aardal (2010) [2] to estimate the total weighted facility open cost and shipping cost.