Formal Procedures for Connecting Terminals with a Minimum Total Wire Length

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Formal Procedures for Connecting Terminals with a Minimum Total Wire Length

Full text

Pdf (511 KB)

Source

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

Pages: 428 - 437

Year of Publication: 1957

ISSN:0004-5411

Authors

H. Loberman	National Bureau of Standards, Washington, D. C.
A. Weinberger	National Bureau of Standards, Washington, D. C.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 21, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/320893.320896 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	D. KONiG: Theorie der Endlichen und Unendlichen Graphen, Chelsea Publishing Co., 1950.
	2	A. CAYLEY: A Theorem on Trees, Mathematical Papers, Vol. XIII, pp. 26-28.
	3	H. PROFER, Neuer Beweis eines Satzes fiber Permutationen, Arch. Math. Phys. (3), 27 (1918), pp. 142-144.
	4	J. B. KRUSKAL~ JR.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Amer. Math. Soc. 7 (1956), pp. 48--50.

CITED BY 9

	David W. Hightower, The interconnection problem - a tutorial, Proceedings of the 10th workshop on Design automation, p.1-21, June 25-27, 1973
	A. Kershenbaum , R. Van Slyke, Computing minimum spanning trees efficiently, Proceedings of the ACM annual conference, August 01-01, 1972, Boston, Massachusetts, United States
	R. A. Rutman, An algorithm for placement of interconnected elements based on minimum wire length, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	Charles F. Shupe, Automatic component placement in the nomad system, Proceedings of the 12th conference on Design automation, p.162-172, January 1975
	V. Kevin M. Whitney, Algorithm 422: minimal spanning tree [H], Communications of the ACM, v.15 n.4, p.273-274, April 1972
	Tomaso Pomentale, An algorithm for minimizing backboard wiring functions, Communications of the ACM, v.8 n.11, p.699-703, Nov. 1965
	J. S. Mamelak, The Placement of Computer Logic Modules, Journal of the ACM (JACM), v.13 n.4, p.615-629, Oct. 1966
	Charles F. Shupe, Automatic component placement in an interactive minicomputer environment, Proceedings of the 18th conference on Design automation, p.145-152, June 29-July 01, 1981, Nashville, Tennessee, United States
	Melvin A Breuer, The application of integer programming in design automation, Proceedings of the SHARE design automation project, p.2.1-2.19, January 1966