On Achieving Local View Capacity Via Maximal Independent Graph Scheduling

DOI10.1109/TIT.2011.2119630zbMath1366.94344arXiv1004.5588MaRDI QIDQ5280924

Amir Salman Avestimehr, Ashutosh Sabharwal, Vaneet Aggarwal

Publication date: 27 July 2017

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

Full work available at URL: https://arxiv.org/abs/1004.5588

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

A branch-and-price-and-cut method for computing an optimal bramble

This page was built for publication: On Achieving Local View Capacity Via Maximal Independent Graph Scheduling