A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. |
scientific article; zbMATH DE number 1856382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. |
scientific article; zbMATH DE number 1856382 |
Statements
A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (English)
0 references
21 January 2003
0 references
Design of algorithms
0 references
Computational geometry
0 references
NP-complete
0 references
Optimization
0 references
Partitioning
0 references
VLSI design
0 references
Sliceable
0 references
