Leicester Research Archive

Leicester Research Archive >
College of Science and Engineering >
Computer Science, Department of >
Published Articles, Dept. of Computer Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/1812

Title: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
Authors: Erlebach, T.
Hall, A.
Issue Date: 2004
Citation: Journal of Scheduling, 2004, 7 (3), pp.223-241
ISSN: 1094-6136
Links: http://dx.doi.org/10.1023/B:JOSH.0000019682.7(...)
http://hdl.handle.net/2381/1812
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:

There are no files associated with this item.

View Statistics

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

 

MAINTAINER