Facility Location on Planar Graphs with Unreliable Links
Hassin et al.  consider the Max-Exp-Cover-R problem to study the facility location problem on a graph in the presence of unreliable links when the link failure is according to the Linear Reliability Order (LRO) model. They showed that for unbounded R the problem is polynomial time solvable and for \(R=1\) and planar graphs the problem is NP-Complete. In this paper, we study the Max-Exp-Cover-1 problem under the LRO edge failure model. We obtain a fixed parameter tractable algorithm for Max-Exp-Cover-1 problem for bounded treewidth graphs, parameterized by the treewidth. We extend the Baker’s technique (Baker, J. ACM 1994) to obtain PTAS for Max-Exp-Cover-1 problem under the LRO model on planar graphs. We observe that the coverage function of the Max-Exp-Cover-R problem is submodular and the problem admits a \((1-1/e)\)-approximation for any failure model in which the expected coverage of a set by another set can be computed in polynomial time.
- 6.Ding, W.: Computing the most reliable source on stochastic ring networks. In: 2009 WRI World Congress on Software Engineering, vol. 1, pp. 345–347, May 2009Google Scholar
- 7.Ding, W.: Extended most reliable source on an unreliable general network. In: 2011 International Conference on Internet Computing and Information Services, pp. 529–533, September 2011Google Scholar
- 12.Lovasz, L.: Matching Theory (North-Holland Mathematics Studies). Elsevier Science Ltd., Oxford (1986)Google Scholar