Fast approximate PCPs for multidimensional bin-packing problems☆
Under an Elsevier user license
open archive
Keywords
Proof-assisted property testing
Probabilistically checkable proofs
Multidimensional bin-packing problems
Sublinear-time algorithms
Cited by (0)
- ☆
Preliminary version appeared in the 3rd International Workshop on Randomization and Approximations Techniques in Computer Science, Random ’99. This work was partially supported by ONR N00014-97-1-0505, MURI, NSF Career grant CCR-9624552, and an Alfred P. Sloan Research Award. The third author was supported in part by an ASSERT grant.
- 1
This research was done while the author was a graduate student in the Department of Computer Science at Cornell University
- 2
Part of this research was done while the author was visiting at IBM Almaden Research Center
Copyright © 2004 Published by Elsevier Inc.