On Steiner Minimal Trees with Rectilinear Distance

Cited In (62)

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

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)