Optimization of the greedy search algorithms for combined data sequences

: pp. 29 - 36
Lviv Polytechnic National University, Department of Information Technology Security

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

  1. G. E. Moore, "No Exponential Is Forever: But 'Forever' Can Be Delayed!" Solid-State Circuits Conference, IEEE International Digest of Technical Papers, Vol. 1, 2003, pp. 20-23.
  2. Corman, T., Leiserson, C., Revelt, R., Stein, K. Chapter 16. Greedy Algorithms // Algorithms: Constructing and Analysis = Introduction to Algorithms, Ed. I. V. Krasikova. - 2nd ed. - M .: Williams, 2005 - 1296 pp. - ISBN 5-8459-0857-4.
  3. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms (MIT Press, 2000).
  4. Mazur, David R. (2010), Combinatorics: A Guided Tour, Mathematical Association of America, ISBN 978-0-88385-762-5.