Pages that link to "Item:Q3789373"
From MaRDI portal
The following pages link to Probabilistic partitioning algorithms for the rectilinear steiner problem (Q3789373):
Displaying 9 items.
- Comments on Bern's probabilistic results on rectilinear Steiner trees (Q911764) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup> (Q4319526) (← links)