On some euclidean clustering problems: Np-hardness and efficient approximation algorithms

Alexander Kel'manov

Research output: Contribution to journalArticlepeer-review

Abstract

We consider some poorly studied clustering problems. The paper purpose is to present a short survey on some new results on the computational complexity of these problems, and on efficient algorithms with performance guarantees for their solutions.

Original languageEnglish
Pages (from-to)291-297
Number of pages7
JournalCEUR Workshop Proceedings
Volume1987
Publication statusPublished - 2017

Fingerprint Dive into the research topics of 'On some euclidean clustering problems: Np-hardness and efficient approximation algorithms'. Together they form a unique fingerprint.

Cite this