NP-hardness of Euclidean sum-of-squares clustering - Concepedia

Concepedia

Publication | Open Access

NP-hardness of Euclidean sum-of-squares clustering

DOI Full Paper Access

845

Citations

8

References

2009

Year

Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat

Machine Learning

Mathematical ProgrammingCluster ComputingEngineeringEuclidean Sum-of-squaresGeometric AlgorithmComputational ComplexityP Versus Np ProblemDiscrete MathematicsCombinatorial Optimization

References

	Year	Citations

Page 1