Optimization of the greedy search algorithms for combined data sequences
The paper describes optimization of the greedy algorithm that can be used to optimize the placement / routing between components in computer systems, when the sequences of data were obtained by using combinations. The disadvantages of original greedy algorithm were analyzed and its optimized version, which is based on an ordered matrix notation to store permutation, was proposed. This approach increases algorithm performance in 2.7 times for 482 unique items