Issue No. 06 - June (2006 vol. 55)

ISSN: 0018-9340

pp: 783-784

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2006.84

ABSTRACT

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.

INDEX TERMS

Steiner trees, shortest network under a fixed topology, polygonal Minkowski unit circle, linear programming.

CITATION

M. Zachariasen, "Comment on "Computing the Shortest Network under a Fixed Topology'," in

*IEEE Transactions on Computers*, vol. 55, no. , pp. 783-784, 2006.

doi:10.1109/TC.2006.84

CITATIONS

SEARCH