科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper considers a problem of locating the given number of disks into a container no that the area covered by the disks is maximized. In the problem, the radii of the disks can be changed arbitrarily unless they overlap outside of the container, and the disks are allowed to overlap with each other. We present an approximation algorithm for this problem assuming that the container is a convex polygon. Our algorithm achieves approximation ratio (0.78 - epsilon) for any small epsilon > 0. Since the computation tine of our algorithm depends on the number of corners of the convex polygon exponentially, we also give a heuristic to reduce the number of corners.
- 出版日期2011-12
