Complexity of the repeaters allocating problem

  • Authors:

  • Nen-Fu Huang;Ching-Ho Huang

  • Affiliations:

  • -;-

  • Venue:
  • Information Processing Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.89

Visualization

Abstract

Given a set C = {c"1, C"2,...c"2} of n circles in the plane, in which circle c"i is centered at point p"i and has a radius of r"i, the repeaters allocating problem (RAP) is to allocate a set R = {p"n"+" "1, P"n"+"2..., p"n"+"m} of points (called repeaters) in the plane such that G(C, R) is strongly connected and the number of allocated repeaters is minimal; where digraph G(C, R) = (V, E), in which a vertex @n"i @? V stands for the point p"i, 1 @? i @? n+ m:, and a directed edge @? E if and only if p"j is located within the circle of p"i (the circle of p"k, n