The Community for Technology Leaders
Green Image
In a recent paper [2], a linear programming formulation was given for the problem of computing a shortest network under a fixed topology (under the \lambda{\hbox{-}}{\rm metric}). We point out a nontrivial error in this paper and give a correct and simpler linear programming formulation. We also show that the result can be generalized to any distance function given by a Minkowski unit circle that is a centrally symmetric polygon.
Steiner trees, shortest network under a fixed topology, polygonal Minkowski unit circle, linear programming.

M. Zachariasen, "Comment on "Computing the Shortest Network under a Fixed Topology'," in IEEE Transactions on Computers, vol. 55, no. , pp. 783-784, 2006.
86 ms
(Ver 3.3 (11022016))