A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels

This paper presents a polynomial-time approximation algorithm for labeling some of the points in a given set of weighted points with horizontally sliding labels of unit height and given lengths to maximize the weight of the labeled points. The approach is based on a discretization, and two results are established: In general, the algorithm has an approximation factor of 2/3 �, for arbitrary fixed � > 0. If the ratio of maximal to minimal label lengths is bounded by a constant, the approximation factor becomes 1 �.