Skip to main content

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

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

  • 113 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hardy A., Rasson J.-P.: A Statistical Approach to Cluster Analysis, Proc. DIANA conference, Mathematical Institute of the Czechoslovak Academy of Sciences, Prague 1982, 231–147.

    Google Scholar 

  2. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Freeman, San Francisco, 1979.

    Google Scholar 

  3. Späth H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood Ltd., 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Křivánek, M., Morávek, J. (1985). Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028807

Download citation

  • DOI: https://doi.org/10.1007/BFb0028807

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics