Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flowThomas Erlebach, Alexander Hall. soda 2002: 194-202 [doi]
The following publications are possibly variants of this publication: