NP-Hard Module Rotation Problems

Authors:
Keumog Ahn;Sartaj Sahni
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1993

Citing 5
Cited 0

Solutions to the module orientation and rotation problems by neural computation networks

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Fundamentals of Data Structures in Pascal

Fundamentals of Data Structures in Pascal
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Flipping Modules to Minimize Maximum Wire Length

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Quantified Score

Hi-index	14.98

Visualization

Abstract

Preplaced circuit modules may be rotated to improve performance and/or routability. It is shown that several simple versions of the module rotation problem are NP-hard.