Half-duplex routing is NP-hard

Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti. Half-duplex routing is NP-hard. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017. pages 89-96, IEEE, 2017. [doi]

@inproceedings{EzzeldinCFT17-0,
  title = {Half-duplex routing is NP-hard},
  author = {Yahya H. Ezzeldin and Martina Cardone and Christina Fragouli and Daniela Tuninetti},
  year = {2017},
  doi = {10.1109/ALLERTON.2017.8262723},
  url = {https://doi.org/10.1109/ALLERTON.2017.8262723},
  researchr = {https://researchr.org/publication/EzzeldinCFT17-0},
  cites = {0},
  citedby = {0},
  pages = {89-96},
  booktitle = {55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017},
  publisher = {IEEE},
  isbn = {978-1-5386-3266-6},
}