An optimal solution to a wire-routing problem

DOI10.1016/0022-0000(81)90010-6zbMath0468.94020OpenAlexW1965663795MaRDI QIDQ1156772

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item