Fast approximate PCPs for multidimensional bin-packing problems

Information and Computation

Volumn 196, Issue 1, 2005, Pages 42-56

  Batu, Tuǧkan ^a   Rubinfeld, Ronitt ^b   White, Patrick ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Multidimensional bin packing problems; Probabilistically checkable proofs; Proof assisted property testing; Sublinear time algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; FUNCTIONS; PROBABILITY; SET THEORY;

COORDINATES; MULTIDIMENSIONAL BIN-PACKING PROBLEMS; PROBABILISTICALLY CHECKABLE PROOFS; PROOF-ASSISTED PROPERTY TESTING; SUBLINEAR-TIME ALGORITHMS;

PROBLEM SOLVING;

EID: 10644273353     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.10.001     Document Type: Article

References (9)

1. L. Babai, L. Fortnow, C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity 1 (1991) 3-40.
2. L. Babai, L. Fortnow, L.A. Levin, M. Szegedy, Checking computations in polylogarithmic time, in: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, 1991, pp. 21-31.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, Journal of the ACM 45 (3) (1998) 501-555.
4. F. Ergun, R. Kumar, R. Rubinfeld, Fast approximate probabilistically checkable proofs, Information and Computation 189 (2) (2004) 135-159.
5. F. Ergun, S. Kannan, R. Kumar, R. Rubinfeld, M. Viswanathan, Spot-checkers, Journal of Computer and System Sciences 60 (3) (2000) 717-752.
6. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, Testing monotonicity, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, 1998, pp. 426-435.
7. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, A. Samorodnitsky, Improvedtesting algorithms for monotonicity, in: D. Hochbaum, K. Jensen, J.D. Rolim,A. Sinclair (Eds.), Randomization, Approximation, and CombinatorialOptimization, vol. 1671, LNCS, Berkeley, California, 1999, pp. 96-108.
8. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, 2002, pp. 474-483.
9. S. Halevy, E. Kushilevitz, Distribution-free property testing, in: RANDOM international Workshop on Randomization and Approximation Techniques in Computer Science, vol. 1671, LNCS, Princeton, NJ, 2003, pp. 302-317.