Fast Approximate PCPs for Multidimensional Bin-Packing Problems-Reference-Cited by-同舟云学术

Fast Approximate PCPs for Multidimensional Bin-Packing Problems

Published:1999 Issue: Volume: Page:245-256
ISSN:0302-9743
Container-title:Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Batu Tuğkan,Rubinfeld Ronitt,White Patrick

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-48413-4_25

Reference9 articles.

1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. of the ACM 45(3), 501–555 (1998)

2. Batu, T., Rubinfeld, R., White, P.: Fast approximate PCPs for multidimensional bin-packing problems, http://simon.cs.cornell.edu/home/ronitt/PAP/bin.ps

3. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 3–40 (1991)

4. Babai, L., Fortnow, L., Lund, C., Szegedy, M.: Checking computations in polylogarithmic time. In: Proc. 31st Foundations of Computer Science, pp. 16–25 (1990)

5. Lecture Notes in Computer Science;Y. Dodis,1999

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Novel Resource Allocation Algorithm for Energy-Efficient Cloud Computing in Heterogeneous Environment;Cloud Technology;2015

2. Novel Resource Allocation Algorithm for Energy-Efficient Cloud Computing in Heterogeneous Environment;International Journal of Grid and High Performance Computing;2014-01

3. Property Testing Lower Bounds via Communication Complexity;computational complexity;2012-05-30

4. Testing of matrix-poset properties;Combinatorica;2007-05

5. Information Theory in Property Testing and Monotonicity Testing in Higher Dimension;STACS 2005;2005