The discrete movable-antenna position selection problem for MI maximization is shown to be monotone submodular under a minimum-spacing constraint, and a greedy algorithm achieves a 1/3 approximation in polynomial time.
A tutorial on movable antennas for wireless networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Efficient Discrete Position Design for Movable Antenna Systems: Low Complexity and Robustness
The discrete movable-antenna position selection problem for MI maximization is shown to be monotone submodular under a minimum-spacing constraint, and a greedy algorithm achieves a 1/3 approximation in polynomial time.