Please use this identifier to cite or link to this item:
Title: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
Authors: Erlebach, T.
Hall, A.
First Published: 2004
Citation: Journal of Scheduling, 2004, 7 (3), pp.223-241
ISSN: 1094-6136
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.