“…The problem of optimal box positioning has wide applications in computational geometry, data mining, and pattern recognition (e.g., see [1][2][3]). In [4], the authors presented a clustering approach based on the greedy algorithm that finds an approximate solution of the optimal box positioning problem. The algorithm was inspired by the apparatus of maximum interval pattern concepts (see, e.g., [4,5]), a technique that allows one to select patterns from fuzzy contexts.…”