Fast Approximate PCPs for Multidimensional Bin-Packing Problems

Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blocks can be packed into a small number of bins. The running time of the verifier is bounded by ¥ ¦ § ¦¨©©, where § ¦¨© is the time required to test for heaviness. We give heaviness testers that can test heaviness of an element in the domain      ¨ in time ¥ ¦¦ ¨©©. We also also give approximate PCPs with efficient verifiers for recursive bin packing and multidimensional routing.

• Type: Conference
• Year: 1999
• Where: RANDOM
• Authors: Tugkan Batu, Ronitt Rubinfeld, Patrick White
• Keywords: Approximate Pcps, Multidimensional, Multidimensional Bin-packing Problems, RANDOM 1999, Theoretical Computer Science