NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow.

Thomas Erlebach, Alexander Hall

Browse the full SODA paper archive.