A 75° Angle Constraint for Plane Minimal T1 Trees
- T. Cole
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
In this paper it is shown that the minimum angle between any 2 edges of an Euclidean plane minimal T1 tree, or 3-size Steiner tree, is at least 75°.
- D.Z. Du, Y.J. Zhang, and Q. Feng, “On better heuristic for Eulidean Steiner minimum trees,” in Proc. of the 32nd Ann. Symp. on Foundations of Computer Science, 1991, pp. 431–439.
- D.Z. Du and F.K. Hwang, “A proof of Gilbert and Pollak's conjecture on the Steiner ratio,” Algorithmica, vol. 7, pp. 121–135, 1992.
- Z.A. Melzak, “On the problem of Steiner,” Canad. Math. Bull., vol. 4, pp. 143–148, 1961.
- J.H. Rubinstein and D.A. Thomas, “The calculus of variations and the Steiner problem,” Ann. Oper. Res., vol. 33, pp. 481–499, 1991.
- A 75° Angle Constraint for Plane Minimal T1 Trees
Journal of Combinatorial Optimization
Volume 4, Issue 2 , pp 271-284
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Steiner minimal tree
- T1 tree
- Industry Sectors
- T. Cole (1)
- Author Affiliations
- 1. Department of Electronic and Electrical Engineering, Tokyo Institute of Technology, Meguro-Ku, Tokyo, 152, Japan