NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow: Special Issue on Scheduling

Author： Erlebach Thomas   Hall Alexander  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.7, Iss.3, 2004-05, pp. : 223-241

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Strong NP-hardness of scheduling problems with learning or aging effect

By Janiak Adam  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 577-583

Springer Publishing Company

Access to resources Recommend Favorite

Editorial: Special Issue on Scheduling

By  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 169-169

Springer Publishing Company

Access to resources Recommend Favorite

Special issue: Scheduling theory and applications

By  

Production Planning and Control, Vol. 13, Iss. 2, 2002-03 ,pp. : 103-104

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling Protocols for Switches with Large Envelopes: Special Issue on Scheduling

By Andrews Matthew   Zhang Lisa  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 171-186

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Average Stretch Scheduling: Special Issue on Scheduling

By Bender Michael A.   Muthukrishnan S.   Rajaraman Rajmohan  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 195-222

Springer Publishing Company

Access to resources Recommend Favorite