{'fraction_non_alphanumeric': 0.02337228714524207, 'fraction_numerical': 0.00667779632721202, 'mean_word_length': 4.769230769230769, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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 �.