Wireless information networks
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Clustering to minimize the sum of cluster diameters
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Algorithms for two-box covering
Proceedings of the twenty-second annual symposium on Computational geometry
Computational Geometry: Theory and Applications
On clustering to minimize the sum of radii
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.00 |
This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.