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.

• Type: Conference
• Year: 2010
• Where: SWAT
• Authors: Mark de Berg, Dirk H. P. Gerrits
• Keywords: Air Traffic Control, Labels, Point Labeling Problem, SWAT 2010