@inproceedings{39e99e5ad9f44edabc548824f9096d62,

title = "Approximation algorithms for free-label maximization",

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.",

author = "{Berg, de}, M.T. and D.H.P. Gerrits",

year = "2010",

doi = "10.1007/978-3-642-13731-0_28",

language = "English",

isbn = "978-3-642-13730-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "297--308",

editor = "H. Kaplan",

booktitle = "Algorithm Theory - SWAT 2010 (12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings)",

address = "Germany",

}