The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.98 |
In the design of a telecommunications network, we are given a set of nodes and the required number of channels connecting some pairs of nodes. The problem is to determine the layout of the channels of communication, satisfying the channel requirements at minimum cost. In this paper, we consider different approaches to the problem and concentrate mainly on experimental aspects on medium size networks.