Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations

DOI10.1109/TIT.2014.2359440zbMATH Open1360.90063MaRDI QIDQ2983364

A. Salman Avestimehr, F. Parvaresh, Raúl Hernán Etkin, Ilan Shomorony

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On the Complexity of Scheduling in Half-Duplex Diamond Networks ⋮ On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel

This page was built for publication: Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations

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