Approximation algorithms for the Fault‐Tolerant Facility Placement problem

Approximation algorithms for the Fault‐Tolerant Facility Placement problem

0.00 Avg rating0 Votes
Article ID: iaor20114445
Volume: 111
Issue: 11
Start Page Number: 545
End Page Number: 549
Publication Date: May 2011
Journal: Information Processing Letters
Authors: ,
Keywords: location, programming: linear
Abstract:

? We studied a generalized version of Facility Location (FL) problem. ? We use LP‐rounding technique similar to that used for the standard FL problem. ? Our algorithm is the first polynomial time algorithm for this problem. ? The main novelty is on bounding facility cost.

Reviews

Required fields are marked *. Your email address will not be published.