The repeater tree construction problem

DOI10.1016/J.IPL.2010.08.016MaRDI QIDQ1675870zbMATH OpenOpenAlexFDO

Authors C. Bartoschek, Dieter Rautenbach, Stephan Held, Jens Maßberg, Jens Vygen

Publication date 3 November 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://www.db-thueringen.de/receive/dbt_mods_00013706

zbMATH Keywords

minimum spanning treeanalysis of algorithmsinterconnection networksSteiner treeVLSI designrepeater tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Shallow-light Steiner arborescences with vertex delays
• A deep-submicron Steiner tree.
• scientific article; zbMATH DE number 795222
• Skew minimization problem with possible sink displacement
• scientific article; zbMATH DE number 3891405

Cites work

• Binary trees with choosable edge lengths
• On Steiner Minimal Trees with Rectilinear Distance
• On-line Steiner trees in the Euclidean plane
• The Rectilinear Steiner Tree Problem is $NP$-Complete

Cited in

(6)

• Generalized Huffman coding for binary trees with choosable edge lengths
• Binary trees with choosable edge lengths
• Skew minimization problem with possible sink displacement
• Online binary minimax trees
• Embedding rectilinear Steiner trees with length restrictions
• The rectilinear Steiner tree problem with given topology and length restrictions

This page was built for publication: The repeater tree construction problem

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