Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems

By Berleant Daniel  

Reliable Computing, Vol. 13, Iss. 3, 2007-06 ,pp. : 261-282

Springer Publishing Company

Access to resources Recommend Favorite

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

By Erlebach Thomas   Hall Alexander  

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

Springer Publishing Company

Access to resources Recommend Favorite

NP-hardness of Euclidean sum-of-squares clustering

By Aloise Daniel  

Machine Learning, Vol. 75, Iss. 2, 2009-05 ,pp. : 245-248

Springer Publishing Company

Access to resources Recommend Favorite

A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory

By Shul'gina O. N.  

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 456-463

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Single Machine Scheduling with Learning Effect Considerations

By Cheng T.C.E.  

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 273-290

Springer Publishing Company

Access to resources Recommend Favorite