Library Header Image
LSE Research Online LSE Library Services

Fast approximate PCPs for multidimensional bin-packing problem

Batu, Tugkan ORCID: 0000-0003-3914-4645, Rubinfeld, Ronitt and White, Patrick (1999) Fast approximate PCPs for multidimensional bin-packing problem. Lecture Notes in Computer Science, 1671. pp. 245-256. ISSN 0302-9743

Full text not available from this repository.

Identification Number: 10.1007/978-3-540-48413-4_25


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.

Item Type: Article
Official URL:
Additional Information: © 1999 Springer-Verlag
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 06 Jan 2011 18:14
Last Modified: 15 May 2024 23:44

Actions (login required)

View Item View Item