scientific article; zbMATH DE number 21366

MaRDI QIDQ3980378zbMATH OpenFDO

Authors G. Bär

Publication date 26 June 1992

zbMATH Keywords

NP-completeVLSI circuit layoutfloorplanning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99)

Recommendations

• scientific article; zbMATH DE number 644289
• scientific article; zbMATH DE number 510756
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 1559558
• A polynomial time solution for labeling a rectilinear map
• A special planar satisfiability problem and a consequence of its NP- completeness
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Complexities of efficient solutions of rectilinear polygon cover problems
• scientific article; zbMATH DE number 3957173
• A Polynomial Time Approximation Scheme for the Square Packing Problem

Cited in

(1)

• scientific article; zbMATH DE number 644289 (Why is no real title available?)

This page was built for publication:

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