A generic algorithm for one-dimensional homotopic compaction

DOI10.1007/BF01759037zbMath0703.68047MaRDI QIDQ916367

F. Miller Maley

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

constraint solvingVLSI layoutriver routingcut conditionshomotopic compactionhomotopic routingjog insertionknock-knee routingroutabilitywire length minimizationwire routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Circuits, networks (94C99)

Related Items (2)

On counting pairs of intersecting segments and off-line triangle range searching ⋮ Parity conditions in homotopic knock-knee routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parity conditions in homotopic knock-knee routing
• On the solution of inequality systems relevant to IC-layout
• A mixed-integer linear programming problem which is efficiently solvable
• A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs

This page was built for publication: A generic algorithm for one-dimensional homotopic compaction