Rectilinear group Steiner trees and applications in VLSI design
From MaRDI portal
Publication:1411625
DOI10.1007/s10107-002-0326-xzbMath1030.90132OpenAlexW2074009801MaRDI QIDQ1411625
Martin Zachariasen, André Rohe
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0326-x
Programming involving graphs or networks (90C35) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the minimum corridor connection problem and other generalized geometric problems, A robust and scalable algorithm for the Steiner problem in graphs, Solving Steiner trees: Recent advances, challenges, and perspectives, SCIP-Jack -- a solver for STP and variants with parallelization extensions, The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study, Some formulations for the group Steiner tree problem, Mathematical methods for physical layout of printed circuit boards: an overview, Insight into the computation of Steiner minimal trees in Euclidean space of general dimension, Unnamed Item
Uses Software
