On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems

DOI10.1016/j.ic.2008.07.002zbMath1162.68383OpenAlexW2099292566MaRDI QIDQ958309

Amos Israeli, Dror Rawitz, Oran Sharon

Publication date: 3 December 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.07.002

zbMATH Keywords

schedulingapproximation algorithmsIEEE 802.16/WiMAX systemssequential rectangle placement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Complexity and approximation of an area packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
• Algorithm Theory - SWAT 2004
• Mathematical Foundations of Computer Science 2005

This page was built for publication: On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems