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

Martin Zachariasen

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

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 languageEnglish
JournalIEEE Transactions on Computers
Pages (from-to)783-784
ISSN0018-9340
Publication statusPublished - 2006
Externally publishedYes

Keywords

  • Linear Programming
  • Shortest Network
  • Fixed Topology
  • Lambda-Metric

Fingerprint

Dive into the research topics of 'Comment on "Computing the Shortest Network under a Fixed Topology"'. Together they form a unique fingerprint.

Cite this