Wire segmenting for buffer insertion based on RSTP-MSP

DOI10.1016/S0304-3975(00)00199-7zbMath0983.68144OpenAlexW2052076659MaRDI QIDQ5958123

Eugene Shragowitz, Xiao-Dong Hu, Jun Gu, Bing Lu

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00199-7

zbMATH Keywords

approximation algorithmVLSIminimum spanning treebuffer insertionrectilinear Steiner treewire segment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Approximating minimum Steiner point trees in Minkowski planes

Cites Work

• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• The Steiner tree problem
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• Approximations for Steiner trees with minimum number of Steiner points

This page was built for publication: Wire segmenting for buffer insertion based on RSTP-MSP