The Steiner minimal tree problem in the λ-geometry plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 247-255

[No Author Info available]

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INCREASING FUNCTIONS; LOWER BOUNDS; METRIC SPACES; MINIMUM SPANNING TREES; STEINER MINIMAL TREE; STEINER POINTS; STEINER RATIO; TOTAL LENGTH;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 84990238035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. D. Z. Du and F. K. Hwang, “A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio”, Algorithmim Vol. 7, No. 2/3, 1992, pp. 121-135.
2. D. Z. Du and F. K. Hwaug, “Educing the Steiner Problem in a Normed Space”, SIAM J. Comput. VoL 21, No. 6, 1992, pp. 1001-1007.
3. D. Z. Du, Bian Gao, R. L. Graham, Z. C. Liu and Pang-Jun Wan, “Minimum Steiner Trees in Normed Plane, “Discrete Comput. Geom., 9, 1993, pp.351-370.
4. D. Z. Du and F. K. Hwang, “State of Art on Steiner Ratio Problems,” in Computing in Euclidean Geometry, D. Z. Du and F. K. Hwaug, Eds., World Scientific, 1992, 163-191.
5. B. Gao, D. Z. Du and R. L. Graham, “The Tight Lower Bound fur the Steiner Ratio in Minkowski Planes”, Proc. tenth Annual Symposium on Computational Geometry, June, 1994, pp. 183-191.
6. M. R Garey, R L. Graham and D.S. Johnson, “The Complexity of Computing Steiner Minimal Trees”, SIAM J. AppL Math., 32, 1977, pp.835-859.
7. M. B. Garey and D. S. Johnson, Computers with Intractability: a Guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
8. M. Hanan, “On Steinsr’s Problem with Rectilinear Distance”, SIAM J. Applied Math., Vol 14, No.2, March 1966, pp. 255-265.
9. F. K. Hwang, “One Steiner Minimal Trees with Rectilinear Distance”, SIAM J. Appl. Math., Vol 30, No.1, Jan. 1976. pp. 104-114.
10. D. T. Lee, C. F. Shan and C. L. Ding, “On Steiner Tree Problem with 45° Routing”, IEEE international Symposium circuit and system May, 1995. pp. 1680-1683.
11. p Distance,” Algorithmica, 7 (1992), 179-191.
12. M. Sarrafzadeh and C. K. Wong, “Hierarchical Steiner Tree Construction in Uniform Orientations, IEEE Trans. Gomputer-Aided Dasign, Vol.11, September 1992. pp. 1095-1103.