Fast approximate PCPs for multidimensional bin-packing problems

Authors:
Tuğkan Batu;Ronitt Rubinfeld;Patrick White
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada V5A 1S6;CSAIL, MIT, Cambridge, MA 02139, USA;Computer Science Department, Cornell University, Ithaca, NY 14853, USA
Venue:
Information and Computation
Year:
2005

Citing 7
Cited 9

Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Spot-checkers

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Monotonicity testing over general poset domains

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Testing Algorithms for Monotonicity

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Testing Monotonicity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fast approximate probabilistically checkable proofs

Information and Computation

Algorithmic and Analysis Techniques in Property Testing

Foundations and Trends® in Theoretical Computer Science
Approximating the distance to monotonicity in high dimensions

ACM Transactions on Algorithms (TALG)
Local Monotonicity Reconstruction

SIAM Journal on Computing
Transitive-closure spanners: a survey

Property testing
Local property reconstruction and monotonicity

Property testing
Transitive-closure spanners: a survey

Property testing
Local property reconstruction and monotonicity

Property testing
Sublinear Time Algorithms

SIAM Journal on Discrete Mathematics
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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(log^dn) where n is the number of blocks and d is the dimension.