@inproceedings{50e12dbffbf34438805ba6e6270dfb3c,

title = "Labeling points with weights",

abstract = "Annotating maps, graphs, and diagrams with pieces of text is an important step in information visualization that is usually referred to as label placement. We define nine label-placement models for labeling points with axis-parallel rectangles given a weight for each point. There are two groups; fixed-position models and slider models. We aim to maximize the weight sum of those points that receive a label. We first compare our models by giving bounds for the ratios between the weights of maximum-weight labelings in different models. Then we present algorithms for labeling n points with unit-height rectangles. We show how an O(n log n)-time factor-2 approximation algorithm and a PTAS for fixed-position models can be extended to handle the weighted case. Our main contribution is the first algorithm for weighted sliding labels. Its approximation factor is (2 + e), it runs in O n 2 /e) time and uses O n/e space. We also investigate some special cases.",

author = "S.H. Poon and C.S. Shin and T. Strijk and A. Wolff",

year = "2001",

doi = "10.1007/3-540-45678-3_52",

language = "English",

isbn = "3-540-42985-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "610--622",

editor = "P. Eades and T. Takaoka",

booktitle = "Algorithms and computation : proceedings 12th international symposium, ISAAC 2001, Christchurch, New Zealand, december 19-21, 2001",

address = "Germany",

}