On Steiner’s Problem with Rectilinear Distance
From MaRDI portal
Publication:5530464
DOI10.1137/0114025zbMath0151.33205MaRDI QIDQ5530464
Publication date: 1966
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/25fd10878fc44c9128fce40c2d08fd64ff8e4fb2
Related Items
A probably fast, provably optimal algorithm for rectilinear Steiner trees, Unnamed Item, The Performance of greedy algorithms for the on-line steiner tree and related problems, Cost-minimal trees in directed acyclic graphs, HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES, Wire segmenting for buffer insertion based on RSTP-MSP, Lower bounds for rectilinear Steiner trees in bounded space, Fast heuristic algorithms for rectilinear Steiner trees, Some upper bounds for minimal trees, Polynomially solvable special cases of the Steiner problem in planar networks, The role of Steiner hulls in the solution to Steiner tree problems, An integrated approach to routing and via minimization, How to find Steiner minimal trees in Euclidean \(d\)-space, A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets, The rectilinear Steiner arborescence problem, Two new criteria for finding Steiner hulls in Steiner tree problems, Worst-case minimum rectilinear Steiner trees in all dimensions, A heuristic for Euclidean and rectilinear Steiner problems, Minimal surfaces, crystals, shortest networks, and undergraduate research, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study, The rectilinear class Steiner tree problem for intervals on two parallel lines, Optimal and approximate bottleneck Steiner trees, The Steiner tree problem in orientation metrics, A deep-submicron Steiner tree., A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation., Steiner's problem in double trees, Planar Manhattan local minimal and critical networks, Steiner minimal trees in \(L^ 2_ p\), A practical algorithm for the minimum rectilinear Steiner tree, Steiner minimal trees in rectilinear and octilinear planes, A catalog of Hanan grid problems, Worst-case ratios of networks in the rectilinear plane, Unnamed Item, Steiner's problem and fagnano's result on the sphere, Rectilinear Steiner Trees in Rectangle Trees, Locating the vertices of a steiner tree in an arbitrary metric space
