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
On Metric Clustering to Minimize the Sum of Radii
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Cheap or Flexible Sensor Coverage
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Locating facilities on a network to minimize their average service radius
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Multi cover of a polygon minimizing the sum of areas
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Topology construction for rural wireless mesh networks - a geometric approach
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Connecting a set of circles with minimum sum of radii
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Geometric clustering to minimize the sum of cluster sizes
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Partitioning the nodes of a graph to minimize the sum of subgraph radii
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Maximizing network lifetime on the line with adjustable sensing ranges
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Radar placement along banks of river
Journal of Global Optimization
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
On Clustering to Minimize the Sum of Radii
SIAM Journal on Computing
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A note on multicovering with disks
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
Computational Optimization and Applications
A constant-factor approximation for multi-covering with disks
Proceedings of the twenty-ninth annual symposium on Computational geometry
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| 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.