Matrix columns allocation problems

DOI10.1016/J.TCS.2009.02.015zbMATH Open1166.68004OpenAlexW1982015000MaRDI QIDQ1019735FDOQ1019735

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximation algorithm for the generalized assignment problem
• P-Complete Approximation Problems
• Title not available (Why is that?)
• Approximation and Online Algorithms

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)