scientific article
From MaRDI portal
zbMath0468.68065MaRDI QIDQ3922181
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99)
Related Items
Two probabilistic results on rectilinear Steiner trees, Fast heuristic algorithms for rectilinear Steiner trees, The Steiner tree problem in orientation metrics, A probably fast, provably optimal algorithm for rectilinear Steiner trees, Minimum rectilinear Steiner tree of \(n\) points in the unit square, A heuristic for Euclidean and rectilinear Steiner problems, Steiner's problem in graphs: Heuristic methods, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
