NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
- 1 May 2004
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 7 (3) , 223-241
- https://doi.org/10.1023/b:josh.0000019682.75022.96
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: