Login / Signup
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
Janka Chlebíková
Miroslav Chlebík
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
optimization problems
problems involving
worst case
np complete
approximation schemes
closed form
line segments
axis parallel
np hardness
approximation error
solving problems
information theoretic
data sets
simulated annealing
special case
computational complexity
search algorithm