Complexity and approximation of an area packing problem

Optimization Letters

Volumn 6, Issue 1, 2012, Pages 1-9

  Hurkens, C A J ^a   Lodi, A ^b   Martello, S ^b   Monaci, M ^c   Woeginger, G J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

Approximation; Area packing; Complexity; Worst case analysis

Indexed keywords

APPROXIMATION; COMBINATORICS; COMPLEXITY; LINEAR TIME; NP-HARDNESS; PACKING PROBLEMS; WORST-CASE ANALYSIS;

MOBILE TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 84855219520     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0246-2     Document Type: Article

References (8)

1. Baker R. C., Harman G., Pintz J.: The difference between consecutive primes. II. Proceedings of the London Mathematical Society 83, 532-562 (2001).
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).
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).
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).
7. Israeli A., Sharon O.: An approximation algorithm for sequential rectangle placement. Inf. Process. Lett. 108, 407-411 (2008).
8. McNaughton R.: Scheduling with deadlines and loss functions. Manage Sci. 6, 1-12 (1959).