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 �.
[1] Alexander Wolff,et al. Point labeling with sliding labels , 1999, Comput. Geom..
[2] Subhash Suri,et al. Label placement by maximum independent set in rectangles , 1998, CCCG.
[3] Alexander Wolff,et al. Labeling Points with Weights , 2001, Algorithmica.