Computing the shortest network under a fixed topology

Guoliang Xue, K. Thulasiraman

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


We show that, in any given uniform orientation metric plane, the 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 λ legal orientations for any fixed integer λ ≥ 2. This settles an open problem posed in a recent paper.

Original languageEnglish (US)
Pages (from-to)1117-1120
Number of pages4
JournalIEEE Transactions on Computers
Issue number9
StatePublished - Sep 2002


  • Linear programming
  • Shortest network under a fixed topology
  • Steiner trees
  • Uniform orientation metric plane

ASJC Scopus subject areas

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


Dive into the research topics of 'Computing the shortest network under a fixed topology'. Together they form a unique fingerprint.

Cite this