An optimal solution to a wire-routing problem

DOI10.1016/0022-0000(81)90010-6zbMATH Open0468.94020OpenAlexW1965663795MaRDI QIDQ1156772FDOQ1156772

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

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)