The Generation of Minimal Trees with a Steiner Topology

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Generation of Minimal Trees with a Steiner Topology

Full text

Pdf (705 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 4 (October 1972) table of contents

Pages: 699 - 711

Year of Publication: 1972

ISSN:0004-5411

Author

Shi-Kuo Chang

IBM Thomas J. Watson Research Center, Yorktown Heights, NY and Cornell University, Ithaca, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 35, Citation Count: 8

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321724.321733 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	CHANG, S.K. The design of network configurations with linear or piecewise linear cost functions. Proc. PIB Symposium on Computer-Communication Networks and Teletraffic, Symposia Ser. Vol. 22, Polytechnic Press, Brooklyn, N.Y., 1972.
	2	COURANT, R. AND ROBBINS, H. What is Mathematics? Oxford U. Press, New York, 1941, pp. 354-361.
	3	COCKAYNE, E .J . Computation of minimal length full Steiner trees on the vertices of a convex polygon. Math. Comp. 23, 107 (1969), 521-531.
	4	COCKAYNE, E.J. On the Steiner problem. Canad. Math. Bull. 10 (1967), 431450.
	5	COCKAYNE, E. J. On the efficiency of algorithm for Steiner minimal trees. SIAM J. Appl. Math. 18, 1 (1970), 150-159.
	6	COCKAYNE, E. J., AND MELZAK, Z.A. Steiner's problem for set terminals. Quart. Appl. Math. 26, 2 (1968), 213-218.
	7	COXETER, H. S.M. Introduction to Geometry. Wiley, New York, 1961, pp. 21-22.
	8	GILBERT, E .N . Minimum cost communication networks. Bell System Tech. J. 46 (1967), 2209-2227.
	9	GILBERT, E. N., AND POLLAK, H.O. Steiner minimal trees. SIAM J. Appl. Math. 16, 1 (1968), 1-29.
	10	HANAN, M. On Steiner's problem with rectilinear distance. SIAM J. Appl. Math. 14, 2 (1966), 255-265.
	11	MELZAK, Z.A. On the problem of Steiner. Canad. Math. Bull. 4 (1961), 143-148.
	12	PALERMO, F .P . A network minimization problem. IBM J. Res. Devel. 5 (1961), 335-337.
	13	PRIM, R .C . Shortest connection networks and some generalizations. Bell System Tech. J . 36 (1957), 1389-1401.

CITED BY 8

	Shi-Kuo Chang, A heuristic procedure for distributed computer system design, Proceedings of the 1975 annual conference, p.329-336, January 1975
	K. Shahookar , P. Mazumder, VLSI cell placement techniques, ACM Computing Surveys (CSUR), v.23 n.2, p.143-220, June 1991
	V Kevin M. Whitney , Dixon R. Doll, A database system for the management and design of telecommunication networks, Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design, p.141-147, January 1973
	Bryan T. Preas , Patrick G. Karger, Automatic placement a review of current techniques (tutorial session), Proceedings of the 23rd ACM/IEEE conference on Design automation, p.622-629, July 1986, Las Vegas, Nevada, United States
	J. Soukup , W. F. Chow, Set of test problems for the minimum length connection networks, ACM SIGMAP Bulletin
	J. Soukup, Minimum Steiner trees, roots of a polynomial, and other magic, ACM SIGMAP Bulletin
	Wensheng Zhang , Guohong Cao , Tom La Porta, Dynamic proxy tree-based data dissemination schemes for wireless sensor networks, Wireless Networks, v.13 n.5, p.583-595, October 2007
	Ding-Zhu Du , Ronald L. Graham , Panos M. Pardalos , Peng-Jun Wan , Weili Wu , Wenbo Zhao, Analysis of greedy approximations with nonsubmodular potential functions, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.167-175, January 20-22, 2008, San Francisco, California