On some euclidean clustering problems › Research Explorer

Novosibirsk State University's Research Portal

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

Research output: Contribution to journal › Article › peer-review

Theoretical Cybernetics Section

Alexander Kel'manov

Original language	English
Pages (from-to)	291-297
Number of pages	7
Journal	CEUR Workshop Proceedings
Volume	1987
Publication status	Published - 2017

OECD FOS+WOS

ID: 9648000