Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On Steiner Minimal Trees with Rectilinear Distance - MaRDI portal

On Steiner Minimal Trees with Rectilinear Distance

From MaRDI portal
Publication:4083448

DOI10.1137/0130013zbMath0322.05101OpenAlexW2069712919WikidataQ56288515 ScholiaQ56288515MaRDI QIDQ4083448

Frank K. Hwang

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




Related Items (62)

Rectilinear Steiner Trees in Rectangle TreesThe Steiner tree problem. I: Formulations, compositions and extensions and extension of facetsSteiner Trees with Bounded RC-DelayOn component-size bounded Steiner treesA tight lower bound for the Steiner ratio in Minkowski planesTwo probabilistic results on rectilinear Steiner treesThe Steiner ratio for the dual normed planeFast heuristic algorithms for rectilinear Steiner treesA heuristic for the Steiner problem in graphsThe Steiner problem with edge lengths 1 and 2Steiner minimal trees in \(L^ 2_ p\)The repeater tree construction problemThe Steiner tree problem in orientation metricsA probably fast, provably optimal algorithm for rectilinear Steiner treesExtremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$A fast algorithm for Steiner treesMinimum rectilinear Steiner tree of \(n\) points in the unit squareDijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithmSwap-vertex based neighborhood for Steiner tree problemsOrdered scheduling in control-flow distributed transactional memoryUnnamed ItemComments on Bern's probabilistic results on rectilinear Steiner treesMinimizing path lengths in rectilinear Steiner minimum trees with fixed topologyMinimal Networks: A ReviewA tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problemLocating the vertices of a steiner tree in an arbitrary metric spaceRouting in VLSI-layoutOn Steiner ratio conjecturesA simple proof of Hwang's theorem for rectilinear Steiner minimal treesAn integrated approach to routing and via minimizationThe number of tree stars is \(O^{*}(1.357^k)\)A proof of the Gilbert-Pollak conjecture on the Steiner ratioOn Steiner minimal trees with \(L_ p\) distanceA linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point setsThe rectilinear Steiner arborescence problemSpeeding up the Dreyfus-Wagner algorithm for minimum Steiner treesWorst-case minimum rectilinear Steiner trees in all dimensionsCOMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACEA catalog of Hanan grid problemsOn better heuristics for Steiner minimum treesA simple proof of the planar rectilinear Steiner ratioSteiner trees with bounded RC-delayWorst-case ratios of networks in the rectilinear planeA near linear time approximation scheme for Steiner tree among obstacles in the planeBounding the expected number of rectilinear full Steiner treesWire segmenting for buffer insertion based on RSTP-MSPOn approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)Minimum Steiner trees in normed planesLower bounds for rectilinear Steiner trees in bounded spaceSteiner type ratios of Gromov-Hausdorff spaceBranched coverings and Steiner ratioComputing optimal rectilinear Steiner trees: A survey and experimental evaluationSteiner trees for fixed orientation metricsOn shortest three-edge-connected Steiner networks with Euclidean distanceFixed topology Steiner trees and spanning forests\(1\)-line minimum rectilinear Steiner trees and related problemsApproximation algorithms for solving the line-capacitated minimum Steiner tree problemThe computation of nearly minimal Steiner trees in graphsHeuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational studyThe number of tree stars is O*(1.357k)Planar Manhattan local minimal and critical networksThe Steiner Minimal Tree problem in the λ-geometry plane






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