Skip to main content
SpringerLink
Log in

Complexity and approximation of an area packing problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Motivated by an application in mobile telecommunication systems, we investigate a packing problem in which items are specified in terms of area constraints. We establish strong \({{\mathcal {NP}}}\)-hardness of this problem, provide a linear time 3-approximation algorithm, and discuss the combinatorics of a special case.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baker R.C., Harman G., Pintz J.: The difference between consecutive primes. II. Proceedings of the London Mathematical Society 83, 532–562 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cicconetti, C., Lenzini, L., Lodi, A., Martello, S., Mingozzi, E.C., Monaci, M.: Efficient two dimensional data allocation in mobile WiMAX. In: Proceedings of the 29th IEEE Conference on Computer Communications (2010)

  3. Cohen R., Katzir, L.: Computational analysis and efficient algorithms for micro and macro OFDMA scheduling. In: Proceedings of the 27th IEEE International Conference on Computer Communications, (2008)

  4. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Heath-Brown D.R.: The number of primes in a short interval. Journal für die Reine und Angewandte Mathematik 389, 22–63 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Israeli A., Rawitz D., Sharon O.: On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. Inf. Comput. 206, 1334–1345 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Israeli A., Sharon O.: An approximation algorithm for sequential rectangle placement. Inf. Process. Lett. 108, 407–411 (2008)

    Article  MathSciNet  Google Scholar 

  8. McNaughton R.: Scheduling with deadlines and loss functions. Manage Sci. 6, 1–12 (1959)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    C. A. J. Hurkens & G. J. Woeginger

  2. DEIS, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    A. Lodi & S. Martello

  3. DEI, Università di Padova, Via Gradenigo 6/A, 35131, Padua, Italy

    M. Monaci

Authors
  1. C. A. J. Hurkens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Lodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Monaci
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. G. J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Martello.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hurkens, C.A.J., Lodi, A., Martello, S. et al. Complexity and approximation of an area packing problem. Optim Lett 6, 1–9 (2012). https://doi.org/10.1007/s11590-010-0246-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0246-2

Keywords

Search

Navigation