Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
T. Graham, A. Afzali, et al.
Microlithography 2000
J. LaRue, C. Ting
Proceedings of SPIE 1989
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences