scientific article; zbMATH DE number 4191148

MaRDI QIDQ3210200zbMATH OpenFDO

Authors Bernhard Korte, Hans Jürgen Prömel, Angelika Steger

Publication date 1990

zbMATH Keywords

routing problemSteiner treesVLSI-layout

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99)

Recommendations

• The Steiner tree packing problem in VLSI design
• Two Steiner tree packing problems
• Class Steiner trees and VLSI-design
• Preprocessing Steiner problems from VLSI layout
• scientific article; zbMATH DE number 108281

Cited in

(32)

• An integrated approach to routing and via minimization
• Switchbox routing in VLSI design: Closing the complexity gap
• The rectilinear class Steiner tree problem for intervals on two parallel lines
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• The Steiner tree packing problem in VLSI design
• A deep-submicron Steiner tree.
• A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
• Binary Steiner trees: structural results and an exact solution approach
• Packing Steiner trees: Polyhedral investigations
• Steiner tree packing revisited
• Construction of the current Steiner network of the second optimality rank
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Packing Steiner trees with identical terminal sets
• Computing optimal Steiner trees in polynomial space
• Extending the kernel for planar Steiner tree to the number of Steiner vertices
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• The algorithm and application based on graphs for the symmetrical routing
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Using structured steiner trees for hierarchical global routing
• (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
• Faster Steiner Tree Computation in Polynomial-Space
• scientific article; zbMATH DE number 3910313 (Why is no real title available?)
• scientific article; zbMATH DE number 50320 (Why is no real title available?)
• Power/ground networks in VLSI: are general graphs better than trees?
• scientific article; zbMATH DE number 475618 (Why is no real title available?)
• Preprocessing Steiner problems from VLSI layout
• Parameterized complexity of directed Steiner tree on sparse graphs
• On the complexity of the bilevel minimum spanning tree problem
• A direct k-way hypergraph partitioning algorithm for optimizing the Steiner tree metric
• Switchbox routing in VLSI design: closing the complexity gap (extended abstract)
• A better constant-factor approximation for selected-internal Steiner minimum tree

This page was built for publication:

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