On Steiner Minimal Trees with Rectilinear Distance

Cited in

(62)

Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
The number of tree stars is \(O^{*}(1.357^k)\)
Wire segmenting for buffer insertion based on RSTP-MSP
Ordered scheduling in control-flow distributed transactional memory
The number of tree stars is O*(1.357k)
Minimum Steiner trees in normed planes
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
Bounding the expected number of rectilinear full Steiner trees
Lower bounds for rectilinear Steiner trees in bounded space
Minimal networks: a review
On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
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
Steiner minimal trees in \(L^ 2_ p\)
The Steiner tree problem in orientation metrics
The Steiner problem with edge lengths 1 and 2
The Steiner Minimal Tree problem in the λ-geometry plane
\(1\)-line minimum rectilinear Steiner trees and related problems
The Steiner ratio for the dual normed plane
Worst-case minimum rectilinear Steiner trees in all dimensions
A simple proof of the planar rectilinear Steiner ratio
Routing in VLSI-layout
On Steiner ratio conjectures
The computation of nearly minimal Steiner trees in graphs
The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
An integrated approach to routing and via minimization
Planar Manhattan local minimal and critical networks
A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
On Steiner minimal trees with \(L_ p\) distance
Steiner type ratios of Gromov-Hausdorff space
A tight lower bound for the Steiner ratio in Minkowski planes
Branched coverings and Steiner ratio
Rectilinear Steiner Trees in Rectangle Trees
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
On better heuristics for Steiner minimum trees
Worst-case ratios of networks in the rectilinear plane
A heuristic for the Steiner problem in graphs
A catalog of Hanan grid problems
On shortest three-edge-connected Steiner networks with Euclidean distance
On component-size bounded Steiner trees
Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
Locating the vertices of a steiner tree in an arbitrary metric space
A probably fast, provably optimal algorithm for rectilinear Steiner trees
Minimum rectilinear Steiner tree of \(n\) points in the unit square
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
Swap-vertex based neighborhood for Steiner tree problems
Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
Two probabilistic results on rectilinear Steiner trees
A fast algorithm for Steiner trees
Fast heuristic algorithms for rectilinear Steiner trees
Steiner trees with bounded RC-delay
Steiner trees with bounded RC-delay
The repeater tree construction problem
Fixed topology Steiner trees and spanning forests
A near linear time approximation scheme for Steiner tree among obstacles in the plane
The rectilinear Steiner arborescence problem
scientific article; zbMATH DE number 3717342 (Why is no real title available?)
Extremal networks in \(\lambda\)-geometry, where \(\lambda=3,4,6\)
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Steiner trees for fixed orientation metrics
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
A proof of the Gilbert-Pollak conjecture on the Steiner ratio

This page was built for publication: On Steiner Minimal Trees with Rectilinear Distance

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