Embedding rectilinear Steiner trees with length restrictions
type: Item
instance of: scholarly article
title: Embedding rectilinear Steiner trees with length restrictions
zbMATH Open document ID: 1353.68282
author: Jens Maßberg
published in: Theoretical Computer Science
publication date: 2016-11-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6655870
zbMATH Keywords: Steiner trees with given topology
zbMATH Keywords: rectilinear Steiner trees
zbMATH Keywords: dynamic programming
zbMATH Keywords: totally unimodular
zbMATH Keywords: shallow light Steiner trees
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.06.018
OpenAlex ID: W2467417412
cites work: The repeater tree construction problem
cites work: Q5684698
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Q4945794
cites work: Approximating the weight of shallow Steiner trees
cites work: The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
cites work: The rectilinear Steiner arborescence problem
cites work: The Rectilinear Steiner Arborescence Problem Is NP-Complete
DOI: 10.1016/J.TCS.2016.06.018
Recommended article: The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
Recommended article: Algorithms and Data Structures
Recommended article: Q5323363
Recommended article: Lower bounds for rectilinear Steiner trees in bounded space
Recommended article: Q4246558
Recommended article: Q3347589
Recommended article: Q4242784
Recommended article: Reductions for the rectilinear steiner tree problem
Recommended article: The rectilinear Steiner arborescence problem
Recommended article: Steiner Trees and Convex Geometries
description: scientific article; zbMATH DE number 6655870