Reducing the Steiner problem in four uniform orientations

DOI<287::AID-NET8>3.0.CO;2-R 10.1002/1097-0037(200007)35:4<287::AID-NET8>3.0.CO;2-RzbMath0974.05026OpenAlexW1977119994MaRDI QIDQ4506270

Guoliang Xue, Guo-Hui Lin

Publication date: 12 December 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200007)35:4<287::aid-net8>3.0.co;2-r

zbMATH Keywords

VLSI designroutingSteiner minimum treesuniform orientations

Mathematics Subject Classification ID

Trees (05C05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES, Steiner trees for fixed orientation metrics

Cites Work

• A proof of the Gilbert-Pollak conjecture on the Steiner ratio