Comment on " Computing the shortest network under a fixed topology"
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-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.
shortest network under a fixed topology linear programming steiner trees polygonal minkowski unit circle