On the location of Steiner points in uniformly-oriented Steiner trees
Information Processing Letters
Computing the Shortest Network under a Fixed Topology
IEEE Transactions on Computers
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A new paradigm for general architecture routing
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Rotationally optimal spanning and Steiner trees in uniform orientation metrics
Computational Geometry: Theory and Applications
Locally minimal uniformly oriented shortest networks
Discrete Applied Mathematics
Steiner hull algorithm for the uniform orientation metrics
Computational Geometry: Theory and Applications
Steiner trees for fixed orientation metrics
Journal of Global Optimization
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
Rotational steiner ratio problem under uniform orientation metrics
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Hardness and approximation of octilinear steiner trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Flexibility of steiner trees in uniform orientation metrics
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In this paper we use the variational method to systematically study properties of minimum networks connecting any given set of points (called terminals) in a $\lambda$-plane, in which all lines are in $\lambda$ uniform orientations $i\pi /\lambda\ (0\le i