Pages that link to "Item:Q4174637"
From MaRDI portal
The following pages link to An O(n log n) algorithm for suboptimal rectilinear Steiner trees (Q4174637):
Displayed 11 items.
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)