NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
- 1 May 2004
- journal article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 7 (3), 223-241
- https://doi.org/10.1023/b:josh.0000019682.75022.96