Sciweavers

Share
SWAT
2010
Springer

Approximation Algorithms for Free-Label Maximization

9 years 12 months ago
Approximation Algorithms for Free-Label Maximization
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points in the plane and labels that are unit squares, place a label with each point in P in such a way that the number of free labels (labels not intersecting any other label) is maximized. We develop efficient constant-factor approximation algorithms for this problem, as well as PTASs, for various label-placement models.
Mark de Berg, Dirk H. P. Gerrits
Added 11 Jul 2010
Updated 11 Jul 2010
Type Conference
Year 2010
Where SWAT
Authors Mark de Berg, Dirk H. P. Gerrits
Comments (0)
books