Gaussian downlink user selection subject to access limit, power budget, and rate demands
From MaRDI portal
Publication:2167901
DOI10.1016/j.tcs.2022.07.032WikidataQ114129059 ScholiaQ114129059MaRDI QIDQ2167901
Pengpeng Chen, Peng-Jun Wan, Jinyu Zou, Xiang Liu
Publication date: 1 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.032
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- The budgeted maximum coverage problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
- Approximate Algorithms for the 0/1 Knapsack Problem
- An analysis of approximations for maximizing submodular set functions—I
- Joint Subcarrier and Power Allocation in NOMA: Optimal and Approximate Algorithms
- Fundamentals of Wireless Communication
- Broadcast channels