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. J. Scheduling, 7(3):223-241, 2004. [doi]

Authors

Thomas Erlebach

This author has not been identified. Look up 'Thomas Erlebach' in Google

Alexander Hall

This author has not been identified. Look up 'Alexander Hall' in Google