Hardness of approximation for orthogonal rectangle packing and covering problems.

Miroslav Chlebík Janka Chlebíková

Published in: J. Discrete Algorithms (2009)

Keyphrases

np complete
np hardness
optimization problems
benchmark problems
approximation algorithms
learning theory
problems involving
real time
objective function
hough transform
approximation error
computational problems
approximation schemes