Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete - researchr publication

researchr

You are not signed in
Sign in
Sign up

Mirko Krivánek, Jaroslav Morávek. Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 234-241, Springer, 1985.

Abstract is missing.

runs on WebDSL