The Steiner tree problem in orientation metrics
From MaRDI portal
Publication:1384537
DOI10.1006/jcss.1997.1513zbMath0897.68076MaRDI QIDQ1384537
Publication date: 4 August 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fbb0690255acb8e23d7bb2044cebfa656d150917
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Two probabilistic results on rectilinear Steiner trees
- Fast heuristic algorithms for rectilinear Steiner trees
- A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
- How to find Steiner minimal trees in Euclidean \(d\)-space
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
- A heuristic for Euclidean and rectilinear Steiner problems
- The Steiner tree problem
- On Some Distance Problems in Fixed Orientations
- On the Problem of Steiner
- Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
- Probabilistic partitioning algorithms for the rectilinear steiner problem
- Rectilinear Steiner Trees in Rectangle Trees
- On Steiner Minimal Trees with Rectilinear Distance
- Use of Steiner's problem in suboptimal routing in rectilinear metric
- Rectilinear steiner trees: Efficient special-case algorithms
- An O(n log n) algorithm for suboptimal rectilinear Steiner trees
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- Subclass of the Steiner problems on a plane with rectilinear metric
- On Steiner’s Problem with Rectilinear Distance
- Steiner Minimal Trees
- On the Steiner Problem
- Steiner tree problems
