Approximability of OFDMA Scheduling

DOI10.1007/978-3-642-04128-0_35MaRDI QIDQ3639261zbMATH OpenOpenAlexFDO

Authors Marcel Ochel, Berthold Vöcking

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_35

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
• Optimal scheduling in CDMA packet radio networks
• Approximation for a scheduling problem with application in wireless networks
• Approximation algorithms for wireless link scheduling with flexible data rates
• Performance analysis of scheduling and interference coordination policies for OFDMA networks

Cited in

(2)

• The generalized maximum coverage problem
• Matrix columns allocation problems

This page was built for publication: Approximability of OFDMA Scheduling

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