Skip to main content
SpringerLink
Log in

Fast Approximate PCPs for Multidimensional Bin-Packing Problems

  • Conference paper
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques (RANDOM 1999, APPROX 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1671))

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 T(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((log n)d). We also also give approximate PCPs with efficient verifiers for recursive bin packing and multidimensional routing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  5. Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved Testing Algorithms for Monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 97–108. Springer, Heidelberg (1999)

    Google Scholar 

  6. Ergun, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. In: Proc. 30th Symposium on Theory of Computing, pp. 259–268 (1998)

    Google Scholar 

  7. Ergün, F., Kumar, R., Rubinfeld, R.: Fast PCPs for approximations. In: Proc. 31st Symposium on Theory of Computing (1999)

    Google Scholar 

  8. Fortnow, L., Rompel, J., Sipser, M.: On the power of multi-prover interactive protocols. Theoretical Computer Science 134(2), 545–557 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Goldreich, O., Goldwasser, S., Lehman, E., Ron, D.: Testing Monotonicity. In: Proc. 39th Symposium on Foundations of Computer Science (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY, 14850, USA

    Tuğkan Batu, Ronitt Rubinfeld & Patrick White

Authors
  1. Tuğkan Batu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ronitt Rubinfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick White
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley

    Dorit S. Hochbaum

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Centre Universitaire d’Informatique, Battelle Bâtiment A, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. Computer Science Division, University of California, 94720, Berkeley, CA

    Alistair Sinclair

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Batu, T., Rubinfeld, R., White, P. (1999). Fast Approximate PCPs for Multidimensional Bin-Packing Problems. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48413-4_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66329-4

  • Online ISBN: 978-3-540-48413-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation