| Packing to Angles and Sectors (2008) | |||||||||||||||
Abstract | |||||||||||||||
| In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, a directional antenna with parameters #, #, R is a set of points with radial coordinates (#, r) such that # # # # #+# and r # R. Given a set of possible directional antennas we want to cover all customers positions so that the demands of customers assigned to an antenna stay within a bound. We provide approximation algorithms for three versions of this capacitated cover problem arising in wireless networks. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||