An approximation algorithm for sequential rectangle placement

Information Processing Letters

Volumn 108, Issue 6, 2008, Pages 407-411

  Israeli, Amos ^a   Sharon, Oran ^a  

^a NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

Approximation algorithms; Sequential rectangle placement

Indexed keywords

APPROXIMATION ALGORITHMS; MATRIX ALGEBRA; SEQUENTIAL SWITCHING;

POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; SEQUENTIAL RECTANGLE PLACEMENT;

POLYNOMIAL APPROXIMATION;

EID: 53049095655     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.08.001     Document Type: Article

References (7)

1. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press
2. IEEE Standard for Local and Metropolitan Area Networks, IEEE 802.16e, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, June 2005
3. Fishkin A.V., Gerber O., Jansen K., and Solis-Oba R. Packing weighted rectangles into a square. 30th International Symposium on Mathematical Foundations of Computer Science. LNCS vol. 3618 (2005), Springer 352-363
4. Israeli A., Rawitz D., and Sharon O. On the complexity of Sequential Rectangle Placement in IEEE 802.16/WiMax Systems. 15th Annual European Symposium on Algorithms (ESA). LNCS vol. 4698 (2007), Springer 335-346
5. A. Israeli, D. Rawitz, O. Sharon, Efficient Algorithms for Sequential Rectangle Placement in IEEE 802.16/WiMax Systems, Unpublished manuscript, 2007
6. Jansen K., and Zhang G. Maximizing the number of packed rectangles. 9th Scandinavian Workshop on Algorithm Theory. LNCS vol. 3111 (2004), Springer 362-371
7. K. Jansen, G. Zhang, On rectangle packing: Maximizing benefits, in: 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 204-213