Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I) N+1 ) steps is provided.
['Arun Padakandla', 'Rajesh Sundaresan']
Complexity of scheduling for minimum power on a GMAC