{'fraction_non_alphanumeric': 0.011299435028248588, 'fraction_numerical': 0.0, 'mean_word_length': 4.7771739130434785, '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}}
Reducing costs by graph algorithms

In the present paper we describe the usage of graph algorithms for reducing costs in different areas of business activities. Although these examples present just a part of potential that the study of graphs offers for real issues implementation, it does not reduce the role of modeling through tools of graph theory in economics. As an illustration of real implementation of graph models and algorithms in the cost saving task we study a problem of optimal distribution of information desks in a large exhibition hall. This problem is similar to a problem of finding k clusters (attraction zones of each information desk) that minimize the maximum diameter of each cluster. The difference between this task and a task solved in our contribution is in its discrete structure (the move of a visitor is allowed only along paths in a graph) and in the fact that in our case the position of two information desks is predefined. The more optimal is the position of information desks detected, the lower are the organizational costs.