Fast approximate PCPs for multidimensional bin-packing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 245-256

  Batu, Tugkan ^a   Rubinfeld, Ronitt ^a   White, Patrick ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BINS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; RANDOM PROCESSES;

BIN PACKING; MULTI-DIMENSIONAL ROUTING; MULTIDIMENSIONAL BIN PACKING; RUNNING TIME;

OPTIMIZATION;

EID: 84892471183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_25     Document Type: Conference Paper

References (9)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hard­ness of approximation problems, J. of the ACM, 45(3):501-555, 1998.
2. T. Batu, R. Rubinfeld., P. White. Fast approximate PCPs for multidimensional bin-packing problems. http://simon.cs.comeJl.edu/home/mnitt/PAP/bin.ps
3. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity, pp. 3-40, 1991.
4. L. Babai, L. Fortnow, C. Lund, and M. Szegedy. Checking computations in polylogarith- micrime. Proc. 31st Foundations of Computer Science, pp. 16-25, 1990.
5. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron and A. Samorodnitsky Improved Testing Algorithms for Monotonicity. RANDOM ‘99.
6. F. Ergun, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. Proc. 30th Symposium on Theory of Computing, pp. 259-268, 1998.
7. F. Ergun, R. Kumar, R. Rubinfeld. Fast PCPs for approximations. Proc. 31st Symposium on Theory of Computing, 1999.
8. L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134(2):545-557, 1994.
9. Goldreich, S. Goldwasser, E. Lehman, D. Ron. Testing Monotonicity Proc. 39th Sym­posium on Foundations of Computer Science, 1998