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.
|Number of pages||7|
|Journal||CEUR Workshop Proceedings|
|Publication status||Published - 2017|