Pages that link to "Item:Q2498405"
From MaRDI portal
The following pages link to Canonical forms and algorithms for Steiner trees in uniform orientation metrics (Q2498405):
Displaying 18 items.
- Steiner trees for fixed orientation metrics (Q1029671) (← links)
- Expansion of linear Steiner trees (Q1386364) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- On the location of Steiner points in uniformly-oriented Steiner trees. (Q1853076) (← links)
- Rotationally optimal spanning and Steiner trees in uniform orientation metrics (Q1886240) (← links)
- Efficient heuristics for orientation metric and Euclidean Steiner tree problems (Q1977863) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- Steiner hull algorithm for the uniform orientation metrics (Q2479469) (← links)
- Minimum networks in uniform orientation metrics (Q2706126) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- Forbidden subpaths for Steiner minimum networks in uniform orientation metrics (Q3150128) (← links)
- Flexibility of Steiner trees in uniform orientation metrics (Q3367055) (← links)
- Reducing the Steiner problem in four uniform orientations (Q4506270) (← links)
- HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES (Q5297794) (← links)
- Quasipolynomial-time canonical form for steiner designs (Q5495796) (← links)
- Algorithms and Computation (Q5712110) (← links)
- Steiner trees in general nonuniform orientations (Q5937569) (← links)
