## Abstract

In this paper, we are concerned with the weighted backup 2-center problem on a tree. The backup 2-center problem is a kind of center facility location problem, in which one is asked to deploy two facilities, with a given probability to fail, in a network. Given that the two facilities do not fail simultaneously, the goal is to find two locations, possibly on edges, that minimize the expected value of the maximum distance over all vertices to their closest functioning facility. In the weighted setting, each vertex in the network is associated with a nonnegative weight, and the distance from vertex u to v is weighted by the weight of u. With the strategy of prune-and-search, we propose a linear time algorithm, which is asymptotically optimal, to solve the weighted backup 2-center problem on a tree.

Original language | English |
---|---|

Pages (from-to) | 426-439 |

Number of pages | 14 |

Journal | Algorithmica |

Volume | 77 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2017 Feb 1 |

Externally published | Yes |

## Keywords

- Backup 2-center
- Prune-and-search
- Quasiconvex function
- Weighted center

## ASJC Scopus subject areas

- General Computer Science
- Computer Science Applications
- Applied Mathematics