Abstract
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.
Original language | English |
---|---|
Journal | IEEE Transactions on Computers |
Pages (from-to) | 783-784 |
ISSN | 0018-9340 |
Publication status | Published - 2006 |
Externally published | Yes |
Keywords
- Linear Programming
- Shortest Network
- Fixed Topology
- Lambda-Metric