The backup 2-center and backup 2-median problems on trees

Hung Lung Wang, Bang Ye Wu, Kun Mao Chao*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

In this paper, we are concerned with the problem of deploying two servers in a tree network, where each server may fail with a given probability. Once a server fails, the other server will take full responsibility for the services. Here, we assume that the servers do not fail simultaneously. In the backup 2-center problem, we want to deploy two servers at the vertices such that the expected distance from a farthest vertex to the closest functioning server is minimum. In the backup 2-median problem, we want to deploy two servers at the vertices such that the expected sum of distances from all vertices to the set of functioning servers is minimum. We propose an O(n)-time algorithm for the backup 2-center problem and an O(n log n)-time algorithm for the backup 2-median problem, where n is the number of vertices in the given tree network.

Original languageEnglish
Pages (from-to)39-49
Number of pages11
JournalNetworks
Volume53
Issue number1
DOIs
Publication statusPublished - 2009 Jan
Externally publishedYes

Keywords

  • Center
  • Location problem
  • Median
  • Tree

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'The backup 2-center and backup 2-median problems on trees'. Together they form a unique fingerprint.

Cite this