Use of Steiner's problem in suboptimal routing in rectilinear metric
From MaRDI portal
Publication:4110824
DOI10.1109/TCS.1976.1084243zbMath0342.90056OpenAlexW2161014683MaRDI QIDQ4110824
N. K. Bose, Jerry H. Lee, Frank K. Hwang
Publication date: 1976
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcs.1976.1084243
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)
Related Items
Two probabilistic results on rectilinear Steiner trees, Fast heuristic algorithms for rectilinear Steiner trees, The Steiner tree problem in orientation metrics, A probably fast, provably optimal algorithm for rectilinear Steiner trees, A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem, An integrated approach to routing and via minimization, A heuristic for Euclidean and rectilinear Steiner problems, An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations, A fast and simple Steiner routing heuristic, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study