On the solution of inequality systems relevant to IC-layout

DOI10.1016/0196-6774(84)90020-8zbMath0567.68029OpenAlexW1977463901MaRDI QIDQ3683536

Thomas Lengauer

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90020-8

zbMATH Keywords

VLSINP-completeCAD systemssystems of linear inequalitiescomplexity of the solutionlayout of integrated circuitslayout geometrylayout topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Linear inequalities of matrices (15A39) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Efficient cell-based migration of VLSI layout ⋮ Fast algorithms for one-dimensionsal compaction with jog insertion ⋮ Compaction and separation algorithms for non-convex polygons and their applications ⋮ A generic algorithm for one-dimensional homotopic compaction

This page was built for publication: On the solution of inequality systems relevant to IC-layout