Comment on "Computing the Shortest Network under a Fixed Topology'

Authors:
M. Zachariasen
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
2006

Citing 2
Cited 1

On some distance problems in fixed orientations

SIAM Journal on Computing
Computing the Shortest Network under a Fixed Topology

IEEE Transactions on Computers

Steiner trees for fixed orientation metrics

Journal of Global Optimization

Quantified Score

Hi-index	14.98

Visualization

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.