Skip to main content
Article thumbnail
Location of Repository

Fast approximate PCPs for multidimensional bin-packing problem

By Tugkan Batu, Ronitt Rubinfeld and Patrick White

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 O(T(n)), where T(n) is the time required to test for heaviness. We give heaviness testers that can test heaviness of an element in the domain [1, ...,n]d in time O((log n)d). We also also give approximate PCPs with efficient verifiers for recursive bin packing and multidimensional routing

Topics: QA Mathematics
Publisher: Springer
Year: 1999
DOI identifier: 10.1109/SFCS.2000.892113
OAI identifier: oai:eprints.lse.ac.uk:31236
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1109/SFCS... (external link)
  • http://eprints.lse.ac.uk/31236... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.