Steiner trees with bounded RC-delay

DOI10.1007/s00453-016-0149-4zbMath1369.68355OpenAlexW2343109328MaRDI QIDQ527413

Rudolf Scheifele

Publication date: 11 May 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0149-4

zbMATH Keywords

approximation algorithmVLSI designSteiner trees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rectilinear Steiner arborescence problem
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Faster algorithm for optimum Steiner trees
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Combinatorial Problems in Chip Design
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Shallow-Light Steiner Arborescences with Vertex Delays
• Reducibility among Combinatorial Problems
• 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