On Steiner Minimal Trees with Rectilinear Distance

Cited in

(63)

Steiner trees for fixed orientation metrics
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
The repeater tree construction problem
Minimum rectilinear Steiner tree of n points in the unit square
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Swap-vertex based neighborhood for Steiner tree problems
Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
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\)
On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
1-line minimum rectilinear Steiner trees and related problems
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Steiner type ratios of Gromov-Hausdorff space
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
Branched coverings and Steiner ratio
Minimal networks: a review
Bounding the expected number of rectilinear full Steiner trees
The number of tree stars is O*(1.357k)
Steiner trees with bounded RC-delay
scientific article; zbMATH DE number 3717342 (Why is no real title available?)
Rectilinear Steiner Trees in Rectangle Trees
Locating the vertices of a steiner tree in an arbitrary metric space
A probably fast, provably optimal algorithm for rectilinear Steiner trees
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
The computation of nearly minimal Steiner trees in graphs
Steiner trees with bounded RC-delay
Extremal networks in -geometry, where =3,4,6
The Steiner Minimal Tree problem in the λ-geometry plane
Wire segmenting for buffer insertion based on RSTP-MSP
Ordered scheduling in control-flow distributed transactional memory
On better heuristics for Steiner minimum trees
Rectilinear Steiner trees in narrow strips
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

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)