NP-hardness of Euclidean sum-of-squares clustering

Author： Aloise Daniel  

Publisher： Springer Publishing Company

ISSN： 0885-6125

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

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

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

By Aloise Daniel   Hansen Pierre  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 449-465

Springer Publishing Company

Access to resources Recommend Favorite

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

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

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

A novel weighted recursive least squares based on Euclidean particle swarm optimization

By Soltani Moêz   Chaari Abdelkader  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 42, Iss. 2, 2013-02 ,pp. : 268-281

Emerald Group Publishing Ltd

Access to resources Recommend Favorite