@article{Chazelle1986OnAC,
title={On a circle placement problem},
author={Bernard Chazelle and D. T. Lee},
journal={Computing},
year={1986},
volume={36},
pages={1-16}
}

We consider the following circle placement problem: given a set of pointsp i ,i=1,2, ...,n, each of weightw i , in the plane, and a fixed disk of radiusr, find a location to place the disk such that the total weight of the points covered by the disk is maximized. The problem is equivalent to the so-called maximum weighted clique problem for circle intersection graphs. That is, given a setS ofn circles,D i ,i=1,2, ...,n, of the same radiusr, each of weightw i , find a subset ofS whose common… CONTINUE READING