Thomas Erlebach, Alexander Hall. NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Scheduling, 7(3):223-241, 2004. [doi]
@article{ErlebachH04,
title = {NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow},
author = {Thomas Erlebach and Alexander Hall},
year = {2004},
doi = {10.1023/B:JOSH.0000019682.75022.96},
url = {http://dx.doi.org/10.1023/B:JOSH.0000019682.75022.96},
tags = {data-flow, source-to-source, open-source},
researchr = {https://researchr.org/publication/ErlebachH04},
cites = {0},
citedby = {0},
journal = {J. Scheduling},
volume = {7},
number = {3},
pages = {223-241},
}