Steiner trees with bounded RC-delay

DOI10.1007/978-3-319-18263-6_19MaRDI QIDQ3453297zbMATH OpenOpenAlexFDO

Authors 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 algorithmSteiner treesVLSI design

Mathematics Subject Classification ID

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

Recommendations

• Steiner trees with bounded RC-delay
• Shallow-light Steiner arborescences with vertex delays
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• A deep-submicron Steiner tree.
• Shortest paths and Steiner trees in VLSI routing

Cites work

• Combinatorial optimization. Theory and algorithms.
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Faster algorithm for optimum Steiner trees
• scientific article; zbMATH DE number 750011 (Why is no real title available?)
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Shallow-light Steiner arborescences with vertex delays
• Steiner tree approximation via iterative randomized rounding
• The rectilinear Steiner arborescence problem
• The Rectilinear Steiner Arborescence Problem Is NP-Complete
• The Rectilinear Steiner Tree Problem is NP-Complete
• The steiner problem in graphs

Cited in

(10)

• Elmor model-based algorithm to select optimal connections on the clock tree
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• A deep-submicron Steiner tree.
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
• Practical approximation algorithms for zero- and bounded-skew trees
• Shortest paths and Steiner trees in VLSI routing
• Shallow-light Steiner arborescences with vertex delays
• Steiner trees with bounded RC-delay
• scientific article; zbMATH DE number 6264040 (Why is no real title available?)
• Wire segmenting for buffer insertion based on RSTP-MSP

This page was built for publication: Steiner trees with bounded RC-delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453297)