An optimal solution to a wire-routing problem

DOI10.1016/0022-0000(81)90010-6MaRDI QIDQ1156772zbMATH OpenOpenAlexFDO

Authors Martin Tompa

Publication date 1981

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(81)90010-6

zbMATH Keywords

VLSIlayout of circuits for very large scale integration

Mathematics Subject Classification ID

Circuits, networks (94C99)

Cited in

(5)

• Convex partial transversals of planar regions
• Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing
• Shortest polygonal paths in space
• Geometric applications of a matrix-searching algorithm
• River routing in VLSI

This page was built for publication: An optimal solution to a wire-routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156772)