Approximation algorithms for free-label maximization

Authors:
Mark de Berg;Dirk H. P. Gerrits
Affiliations:
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands
Venue:
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Year:
2010

Citing 7
Cited 1

Constructing arrangements of lines and hyperplanes with applications

SIAM Journal on Computing
A packing problem with applications to lettering of maps

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Point labeling with sliding labels

Computational Geometry: Theory and Applications - Special issue on applications and challenges
Maximum independent set of rectangles

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimizing active ranges for consistent dynamic map labeling

Computational Geometry: Theory and Applications
New bounds on map labeling with circular labels

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Approximation algorithms for free-label maximization

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.