Computing the Shortest Network under a Fixed Topology

Guoliang Xue, K. Thulasiraman

Research output: Contribution to journalArticlepeer-review

Abstract

shortest network interconnecting a given set of points under a fixed topology can be computed by solving a linear programming problem whose size is bounded by a polynomial in the number of terminals and the number of legal orientations. When the given topology is restricted to a Steiner topology, our result implies that the Steiner minimum tree under a given Steiner topology can be computed in polynomial time in any given uniform orientation metric with A legal orientations for any fixed integer A > 2. This settles an open problem posed in a recent paper [3].

Original languageEnglish (US)
Pages (from-to)1118-1121
Number of pages4
JournalIEEE Transactions on Computers
Volume51
Issue number9
DOIs
StatePublished - Jan 1 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

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

Cite this