The repeater tree construction problem

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

zbMATH Keywords

VLSI designanalysis of algorithmsinterconnection networksminimum spanning treeSteiner treerepeater tree

Mathematics Subject Classification ID

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

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

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

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