Login / Signup
Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations.
Raúl H. Etkin
Farzad Parvaresh
Ilan Shomorony
Amir Salman Avestimehr
Published in:
IEEE Trans. Inf. Theory (2014)
Keyphrases
</>
min cut
scheduling problem
graph partitioning
network structure
information theoretic
complex networks
similarity measure
figure ground