(A) study on the minimax linear placement problem

Abstract

In this thesis, the minimax linear placement problem which minimizes the maximum number of interboard connections in a large system is considered. A solution for this problem has various applications of modern printing circuit board layout and LSI techniques. Three strategies, breaking ties, selecting an initial board from every input board and iterative improvement, are considered to improve C-ALGORITHM, proposed in [10], for obtaining an approximate solution for this problem. Several algorithms given by the combinations of the above three strategies are programmed and tested. It has been found that as O(mn$^2$)-algorithm, Q-A-T-ALGORITHM using the tie breaking strategy and the iterative improvement strategy shows the best practical performance and as O(m$^2$n$^2$, mn$^3$)-algorithm, A-T-ALL-ALGORITHM using all the above three strategies shows the best practical performance.