Complexity and approximability results for slicing floorplan designs. (Q1399599)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1957057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability results for slicing floorplan designs. |
scientific article; zbMATH DE number 1957057 |
Statements
Complexity and approximability results for slicing floorplan designs. (English)
0 references
30 July 2003
0 references
Packing
0 references
cutting
0 references
floorplan design
0 references
VLSI design
0 references
compaction
0 references
computational
0 references
complexity
0 references
approximation
0 references
combinatorial optimization
0 references
0.8857030868530273
0 references
0.7964363098144531
0 references
0.7885464429855347
0 references
0.7807323932647705
0 references
0.7805333733558655
0 references
