The repeater tree construction problem
From MaRDI portal
Publication:1675870
DOI10.1016/J.IPL.2010.08.016zbMath1379.68251OpenAlexW1972057929MaRDI QIDQ1675870
C. Bartoschek, Dieter Rautenbach, Stephan Held, Jens Vygen, Jens Maßberg
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
VLSI designanalysis of algorithmsinterconnection networksminimum spanning treeSteiner treerepeater tree
Related Items (5)
Embedding rectilinear Steiner trees with length restrictions ⋮ The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions ⋮ Online binary minimax trees ⋮ Binary trees with choosable edge lengths ⋮ Generalized Huffman coding for binary trees with choosable edge lengths
Cites Work
This page was built for publication: The repeater tree construction problem