On Steiner Minimal Trees with Rectilinear Distance
From MaRDI portal
Publication:4083448
DOI10.1137/0130013zbMath0322.05101WikidataQ56288515 ScholiaQ56288515MaRDI QIDQ4083448
Publication date: 1976
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0130013
05C05: Trees
Related Items
A probably fast, provably optimal algorithm for rectilinear Steiner trees, The computation of nearly minimal Steiner trees in graphs, Wire segmenting for buffer insertion based on RSTP-MSP, On better heuristics for Steiner minimum trees, Lower bounds for rectilinear Steiner trees in bounded space, Comments on Bern's probabilistic results on rectilinear Steiner trees, A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem, Two probabilistic results on rectilinear Steiner trees, Fast heuristic algorithms for rectilinear Steiner trees, The Steiner problem with edge lengths 1 and 2, A fast algorithm for Steiner trees, Routing in VLSI-layout, On Steiner ratio conjectures, A simple proof of Hwang's theorem for rectilinear Steiner minimal trees, An integrated approach to routing and via minimization, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, On Steiner minimal trees with \(L_ p\) distance, A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets, The rectilinear Steiner arborescence problem, Worst-case minimum rectilinear Steiner trees in all dimensions, A simple proof of the planar rectilinear Steiner ratio, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Fixed topology Steiner trees and spanning forests, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, The Steiner ratio for the dual normed plane, The Steiner tree problem in orientation metrics, On shortest three-edge-connected Steiner networks with Euclidean distance, Minimum Steiner trees in normed planes, Planar Manhattan local minimal and critical networks, On component-size bounded Steiner trees, A tight lower bound for the Steiner ratio in Minkowski planes, A heuristic for the Steiner problem in graphs, Steiner minimal trees in \(L^ 2_ p\), The number of tree stars is \(O^{*}(1.357^k)\), Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees, A catalog of Hanan grid problems, Worst-case ratios of networks in the rectilinear plane, The number of tree stars is O*(1.357k), Unnamed Item, Rectilinear Steiner Trees in Rectangle Trees, Locating the vertices of a steiner tree in an arbitrary metric space
