| Electronic Colloquium on Computational Complexity, Report No. 30 (2006) 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, 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 cover problem. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||