@inproceedings{5c1ab1dce98c49cea4c9363436b982ce,
title = "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 O(T(n)), where X(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((logn)d). We also also give approximate PCPs with efficient verifiers for recursive bin packing and multidimensional routing.",
author = "Tugkan Batu and Ronitt Rubinfeld and Patrick White",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999 ; Conference date: 08-08-1999 Through 11-08-1999",
year = "1999",
doi = "10.1007/978-3-540-48413-4_25",
language = "אנגלית",
isbn = "3540663290",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "245--256",
editor = "Rolim, {Jose D. P.} and Alistair Sinclair and Dorit Hochbaum and Klaus Jansen",
booktitle = "Randomization, Approximation, and Combinatorial Optimization",
address = "גרמניה",
}