Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 187-215

  Smith, J MacGregor ^a   Toppur, Badri ^a  

^a University of Massachusetts   (United States)

Author keywords

Embedding problems; Minimum energy configurations; Steiner trees

Indexed keywords

EID: 0043043358     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00064-9     Document Type: Article

References (40)

1. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete. Comput. Geom. 6 (1991), 407-422.
2. J. Bella, M. Eaton, B. Brodsky and H.M. Berman, Crystal and molecular structure of a Collagen-like 2 peptide At 1.9 angstrom resolution, Science 266 (1994), 75.
3. M. Bern, and D. Eppstein, Mesh generation and optimal triangulation, in: Computing and Euclidean Geometry D.Z. Du and F.K. Hwang, eds., (World Scientific Press; Singapore, 1992), 23-90.
4. M. Bern, and R. Graham, The shortest-network problem, Scientific Amer. 260 (1989), 84-89.
5. J.M. Chen, C.E. Kung, S.E. Feairheller and E.M. Brown, An energetic evaluation ... collagen microfibril model, J. Protein Chem. 10 (1991), 535.
6. F.R.K. Chung, and F.K. Hwang, A lower bound for the Steiner tree problem, Siam J. Appl. Math. 34 (1976), 27-36.
7. F.R.K. Chung, and R.L. Graham, Steiner Trees for Ladders, Ann. of Discrete Math. 2 (1978), 173-200.
8. D.R. Courant and H. Robbins, What is Mathematics? (Oxford Univ. Press, New York, 1941).
9. H.M.S. Coxeter, Introduction to Geometry.
10. G.M. Crippen, Distance Geometry and Conformatinal Calculations (Research Studies Press, Chichester, 1981).
11. J.R.W. Dolan and J.M. Smith, Minimal Length Tree Networks on the Unit Sphere, Ann. Oper. Res. 33 (1991) 503-535.
12. R.E. Dickerson and I. Geis, The Structure and Action of Proteins (Harper and Row, New York; 1969).
13. D.Z. Du, Disproving Gilbert-Pollak conjecture in higher dimensional spaces, manuscript, Computer Science Department, University of Minnesota (1992).
14. D.Z. Du, and F.K. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica 7 (1992), 121-135.
15. D.Z. Du, F.K. Hwang and J.F. Weng, Steiner minimal trees on zig-zag lines, Trans. Amer. Math. Soc. 278 (1982), 149-156.
16. D.Z. Du, and W. Smith, Three disproofs of the Gilbert-Pollak conjecture on Steiner ratio in three or more dimensions, in review.
17. R.B. Fuller, No More Secondhand God. (Souhern Illinois Univ. Press, Carbondale, 1963.)
18. M.R. Garey, R.L. Graham and D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math. 32 (1977), 835-859.
19. M.R. Garey and D.S. Johnson, Computers And Intractability; A Guide to the Theory of Np-completeness: (W.H.Freeman and Co. San Francisco, 1979.)
20. E.N. Gilbert, private communication (1994).
21. E.N. Gilbert, and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16 (1968), 1-29.
22. B.A. Hendrickson, The molecule problem: determining conformation from pairwise distances, Ph.D. Thesis 90-1159. Department of Computer Science, Cornell University, Ithaca, New York, 14853-7501 (1990).
23. F.W. Hwang, and D. Richards, Steiner tree problems, Networks (1989).
24. L. Margulis, private communication (1994).
25. I.J. McColm, Ceramic Science for Materials Technologists Chapman & Hall, New York, (1983).
26. M.H. Miller, and H.A. Scheraga, Calculation of the structures of Collagen models...., J. Polym. Sci. Polym. Symp. 54 (1976), 171-200.
27. G. Nemethy et al., Energy parameters in polypeptides...., J. Phys. Chem. 96 (1992), 6472-6484.
28. L. Pauling, The Architecture of Molecules (1963).
29. P. Pearce, Structure in Nature is a Strategy for Design (MIT Press, Cambridge MA).
30. J.B. Saxe, Embeddability of weighted graphs in k-space is strongly script N sign ℘-Hard, Procedings of the 17th Allerton Conf. on Communication, Control and Computing (1979) 480-489.
31. P. Schorn, Exact and approximate solutions to the embedding problem in distance geometry. Paper Presented at the Computational Geometry Meeting, Raleigh, NC (October 1993).
32. P. Schorn, private communication (1994).
33. W.D. Smith, "How to find Steiner minimal trees in Euclidean d-space," Algorithmica 7 (1992), 137-177.
34. W.D. Smith, Two disproofs of the Gilbert-Pollak Steiner ratio conjecture in d-space for d ≥ 3, in review, NEC Technical Report (1992).
35. J.M. Smith, D.T. Lee and J.S. Liebman, An O(N log N) heuristic for Steiner minimal tree problems on the Euclidean metric, Networks 11 (1981), 23-39.
36. J.M. Smith and J.S. Liebman, Steiner trees, Steiner circuits, and the interference problem in building design, Eng Opt. 4 (1979), 15-36.
37. W.D. Smith and J.M. Smith, On the Steiner ratio in 3-space, J. Combin. Theory, Ser. A 69 (1995), 301-332.
38. 3, Paper presented at the ORSA/TIMS Meeting, Chicago II (May 1993) Networks, accepted.
39. L. Van Meervelt, P.K.T. Moore, D.M. Brown, O. Kennard, Molecular and crystal structure..., J. Mol. Biol. 216 (1990), 773.
40. P. Winter, Steiner problem in networks: a survey, Networks 17 (1987), 129-167.