Complexity and approximability results for slicing floorplan designs.

DOI10.1016/S0377-2217(02)00527-1zbMath1033.90101OpenAlexW2042887188MaRDI QIDQ1399599

Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 30 July 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00527-1

zbMATH Keywords

complexitycombinatorial optimizationapproximationVLSI designPackingcuttingcompactioncomputationalfloorplan design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Optimal cutting directions and rectangle orientation algorithm
• Optimal orientations of cells in slicing floorplan designs
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: Complexity and approximability results for slicing floorplan designs.