• DocumentCode
    926849
  • Title

    Comment on "Computing the shortest network under a fixed topology

  • Author

    Zachariasen, Martin

  • Author_Institution
    Dept. of Comput. Sci., Copenhagen Univ.
  • Volume
    55
  • Issue
    6
  • fYear
    2006
  • fDate
    6/1/2006 12:00:00 AM
  • Firstpage
    783
  • Lastpage
    784
  • 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
  • Keywords
    geometry; linear programming; distance function; fixed topology; lambda-metric; linear programming formulation; nontrivial error; shortest network computing; Geometry; Linear programming; Steiner trees; linear programming.; polygonal Minkowski unit circle; shortest network under a fixed topology;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2006.84
  • Filename
    1628964
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=926849