A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Paper
Cropped cubes
Abstract
We study certain generalized covering polytopes that we call "cropped cubes". These polytopes generalize the clipped cubes which Coppersmith and Lee used to study the nondyadic indivisibility polytopes. Our main results are (i) a totally dual integral inequality description of the cropped cubes, and (ii) an efficient separation procedure.
Related
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Charles Micchelli
Journal of Approximation Theory
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009