An investigation of iterative routing algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An investigation of iterative routing algorithms

Full text

Pdf (609 KB)

Source

European Design Automation Conference archive
Proceedings of the conference on European design automation table of contents

Brighton, England

Pages: 91 - 96

Year of Publication: 1995

ISBN:0-8186-7156-4

Authors

Zahir Moosa	Department of Computer Science, University of Manchester, Oxford Road, Manchester, UK, M13 9PL
Douglas Edwards	Department of Computer Science, University of Manchester, Oxford Road, Manchester, UK, M13 9PL

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

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

Additional Information:

references index terms collaborative colleagues peer to peer

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

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	C. Lee. An algorithm for path connections and its applications. In IRE Transactions on Electronic Computers, pages 346 - 365, 1961.
	2	Z. Moosa. On Improving Maze Routing Algorithms. PhD thesis, University of Manchester, 1992.
	3	L. Abel. On the ordering of connections for automatic wire routing. IEEE Transactins on Computers, pages 1227 - 1233, 1972.
	4	Ralph Linsker, An iterative-improvement penalty-function-driven wire routing system, IBM Journal of Research and Development, v.28 n.5, p.613-624, September 1984
	5	R. Linsker. Wire routing with path history dependent penalty functions. In IBM Technical Disclosure Bulletin, volume 27, pages 399 - 406. 1984.
	6	A. Moore and C. Ravitz. Weighted and iterative multi-wire routing. In IBM Technical Disclosure Bulletin, volume 25, pages 3619 - 3628. 1982.
	7	E. Rosenberg, A new interactive supply/demand router with rip-up capability for printed circuit boards, Proceedings of the 24th ACM/IEEE conference on Design automation, p.721-726, June 28-July 01, 1987, Miami Beach, Florida, United States [doi>10.1145/37888.38003]
	8	Frank Rubin, An iterative technique for printed wire routing, Proceedings of the 11th workshop on Design automation, p.308-313, January 1974
	9	J. Soukup. Circuit layout. Proceedings of the IEEE, 69(10):1281- 1304, 1981.
	10	William A. Dees, Jr. , Patrick G. Karger, Automated rip-up and reroute techniques, Proceedings of the 19th conference on Design automation, p.432-439, January 1982
	11	Kaoru Kawamura , Masanobu Umeda , Hiroshi Shiraishi, Hierarchical dynamic router, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.803-809, July 1986, Las Vegas, Nevada, United States
	12	Zahir Moosa , Michael Brown , Douglas Edwards, An appreciation of simulated annealing to maze routing, Proceedings of the conference on European design automation, p.434-439, September 19-23, 1994, Grenoble, France
	13	Walter S. Scott , John K. Ousterhout, Plowing: Interactive stretching and compaction in magic, Proceedings of the 21st conference on Design automation, p.166-172, June 25-27, 1984, Albuquerque, New Mexico, United States
	14	H. Shin and A.S. Vincentelli. A detailed router based on incremental routing modifications : Mighty. IEEE Transactions on CAD, 6(6):942- 955, 1987.
	15	I. Shirakawa and S. Futagami. A rerouting scheme for single layer printed wiring boards. IEEE Transactions on CAD, 2(4):267- 271, 1983.
	16	T.D. Spiers. A HardwareAssiswdRouting System. PhD thesis, University of Manchester, 1985.