Abstract:
Consideration was given to two formulations of the problem of selecting the optimal types of interconnections on the edges of the given rooted tree along which the signal is transmitted from the root to the terminals. The time interval during which the signal must be received was defined for each terminal. The time of signal propagation which depends on the interconnections used on all tree edges was calculated using the Elmor formulas. It was required to select interconnections of the minimal total capacitance such that the times of signal arrival to each terminal be admissible. Pseudopolynomial algorithms of dynamic programming were proposed to determine optimal solutions of the examined problems.