Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
Facility location and data placement problems have been widely studied. Consider the following problem. We are given a set of facilities F and a set of clients D in a metric space. There are two types of objects. A client may have demand for each of the object types. A facility can be opened for one or both types depending on its storage capacity; there are no facility opening costs. The goal is to determine the facilities to open for each type while respecting their storage capacity constraints and assign every demand to a facility open for its type. We present a 4-approximation LP-rounding based algorithm for this problem.
J. LaRue, C. Ting
Proceedings of SPIE 1989
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences