The distance-domination numbers of trees

  • Authors:

  • Wen-Lian Hsu

  • Affiliations:

  • The Technological Institute, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60201, U.S.A.

  • Venue:
  • Operations Research Letters
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

The P-center problem is to locate P centers in a graph G so that the maximum distance between centers and non-centers is minimized. A related problem is to determine the maximum number of vertices that can be ''covered'' (within a distance of @a) by a vertex set of cardinality P in G. In this paper we describe an O(n^3P) algorithm which solves the maximum coverage problem on trees. We also apply the same idea to solve the P-median problem on trees.