Matrix columns allocation problems

DOI10.1016/J.TCS.2009.02.015MaRDI QIDQ1019735zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri

Publication date 28 May 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.02.015

zbMATH Keywords

NP-completenessinapproximabilityallocation problems

Mathematics Subject Classification ID

Communication theory (94A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10)

Recommendations

• Radio resource allocation problems for OFDMA cellular systems
• Approximability of OFDMA Scheduling
• Optimal radio resources and transmission formats assignment in OFDMA systems
• Optimal power control in OFDMA cellular networks
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 1830744 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• An approximation algorithm for the generalized assignment problem
• Approximation and Online Algorithms
• P-Complete Approximation Problems

Cited in

(2)

• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems

This page was built for publication: Matrix columns allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019735)