On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.

Stefan Porschen

Published in: ICCSA (3) (2004)

Keyphrases

decision problems
np complete
case study
optimization problems
real time
computational complexity
computational cost
upper bound
worst case
space complexity
packing problem