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

Thomas Erlebach, Alexander Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In SODA. pages 194-202, 2002. [doi]

Abstract

Abstract is missing.