J. F. Weng

Learn More
A Steiner minimal tree for a given set P of points in the Euclidean plane is a shortest network interconnecting P whose vertex set may include some additional points. The construction of Steiner minimal trees has been proved to be an jV/'-complete problem for general P. However, the W-completeness does not exclude the possibility that Steiner trees for sets(More)
The Gilbert network problem is a generalization of the Steiner minimal tree problem derived by adding flow-dependent weights to the edges. In this paper, we define a special class of minimum Gilbert networks, called pseudo-Gilbert–Steiner trees, and we show that it can be constructed by Gilbert's generalization of Melzak's method. Besides, a counterexample,(More)