The problem of partitioning an orthogonal polyhedron into a minimum number of boxes was
shown to be NP-hard in 1991, but no approximability result is known except for a 4 …