Embedding rectilinear Steiner trees with length restrictions

DOI10.1016/j.tcs.2016.06.018zbMath1353.68282OpenAlexW2467417412MaRDI QIDQ344768

Jens Maßberg

Publication date: 24 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.018

zbMATH Keywords

dynamic programmingrectilinear Steiner treesshallow light Steiner treesSteiner trees with given topologytotally unimodular

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• The rectilinear Steiner arborescence problem
• Approximating the weight of shallow Steiner trees
• The repeater tree construction problem
• The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The Rectilinear Steiner Arborescence Problem Is NP-Complete

This page was built for publication: Embedding rectilinear Steiner trees with length restrictions