It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a fixed overall construction speed. The problem is strongly NP-hard even on stars. We present polynomial algorithms for the problem on trees with a fixed number of leaves, and on general networks with a fixed number of relevant pairs.

翻译：需要找到构建网络边缘的最佳顺序,以便尽可能减少相关顶端的加权连接时间的总和。 在网络的任何地方,只要有固定的总体建设速度,就可以进行施工。 问题在于恒星的NP-硬度非常高。 我们在树上用固定数量的叶叶树和一般网络上用固定数量的相关配对来提出多名算法。