Approximation algorithms for free-label maximization

M.T. Berg, de, D.H.P. Gerrits

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

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.
Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2010 (12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings)
EditorsH. Kaplan
Place of PublicationBerlin
PublisherSpringer
Pages297-308
ISBN (Print)978-3-642-13730-3
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science
Volume6139
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Approximation algorithms for free-label maximization'. Together they form a unique fingerprint.

Cite this