Steiner Trees with Bounded RC-Delay

DOI10.1007/978-3-319-18263-6_19zbMath1369.68354OpenAlexW750086987MaRDI QIDQ3453297

Rudolf Scheifele

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18263-6_19

zbMATH Keywords

approximation algorithmVLSI designSteiner trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology

Cites Work

• Unnamed Item
• The rectilinear Steiner arborescence problem
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Faster algorithm for optimum Steiner trees
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Shallow-Light Steiner Arborescences with Vertex Delays
• Steiner Tree Approximation via Iterative Randomized Rounding
• The Rectilinear Steiner Arborescence Problem Is NP-Complete
• On Steiner’s Problem with Rectilinear Distance
• The steiner problem in graphs
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Steiner Trees with Bounded RC-Delay