Wire segmenting for buffer insertion based on RSTP-MSP

DOI10.1016/S0304-3975(00)00199-7MaRDI QIDQ5958123zbMATH OpenOpenAlexFDO

Authors B. Lu, J. Gu, Xiaodong Hu, E. Shragowitz

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 algorithmbuffer insertionminimum spanning treerectilinear Steiner treeVLSIwire segment

Mathematics Subject Classification ID

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

Recommendations

• A practical algorithm for the minimum rectilinear Steiner tree
• scientific article; zbMATH DE number 1185330
• Approximations for Steiner trees with minimum number of Steiner points
• Steiner trees with bounded RC-delay
• scientific article; zbMATH DE number 3972878

Cites work

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

Cited in

(1)

• Approximating minimum Steiner point trees in Minkowski planes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958123)