{'fraction_non_alphanumeric': 0.03058103975535168, 'fraction_numerical': 0.010193679918450561, 'mean_word_length': 4.676300578034682, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, '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}}
Robust location problems with pos/neg weights on a tree

In this paper, we consider different aspects of robust 1‐median problems on a tree network with uncertain or dynamically changing edge lengths and vertex weights which can also take negative values. The dynamic nature of a parameter is modeled by a linear function of time. A linear algorithm is designed for the absolute dynamic robust 1‐median problem on a tree. The dynamic robust deviation 1‐median problem on a tree with n vertices is solved in O(n2 α(n) log n) time, where α(n) is the inverse Ackermann function. Examples show that both problems do not possess the vertex optimality property. The uncertainty is modeled by given intervals, in which each parameter can take a value randomly. The absolute robust 1‐median problem with interval data, where vertex weights might also be negative, can be solved in linear time. The corresponding deviation problem can be solved in O(n2) time. © 2001 John Wiley & Sons, Inc.