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]
No references recorded for this publication.
No citations of this publication recorded.