Pages that link to "Item:Q1966510"
From MaRDI portal
The following pages link to A practical algorithm for the minimum rectilinear Steiner tree (Q1966510):
Displaying 14 items.
- A fast and simple Steiner routing heuristic (Q1276958) (← 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)
- Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816) (← links)
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle (Q3487159) (← links)
- (Q3640195) (← links)
- Probabilistic partitioning algorithms for the rectilinear steiner problem (Q3789373) (← links)
- (Q4393289) (← links)
- Reductions for the rectilinear steiner tree problem (Q4894857) (← links)
- Logic Programming (Q5313200) (← links)
