Standard

On some euclidean clustering problems : Np-hardness and efficient approximation algorithms. / Kel'manov, Alexander.

In: CEUR Workshop Proceedings, Vol. 1987, 2017, p. 291-297.

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

Harvard

Kel'manov, A 2017, 'On some euclidean clustering problems: Np-hardness and efficient approximation algorithms', CEUR Workshop Proceedings, vol. 1987, pp. 291-297.

APA

Kel'manov, A. (2017). On some euclidean clustering problems: Np-hardness and efficient approximation algorithms. CEUR Workshop Proceedings, 1987, 291-297.

Vancouver

Kel'manov A. On some euclidean clustering problems: Np-hardness and efficient approximation algorithms. CEUR Workshop Proceedings. 2017;1987:291-297.

Author

Kel'manov, Alexander. / On some euclidean clustering problems : Np-hardness and efficient approximation algorithms. In: CEUR Workshop Proceedings. 2017 ; Vol. 1987. pp. 291-297.

BibTeX

@article{e2fc9f76038d48ad9d43e94f3b2f434e,
title = "On some euclidean clustering problems: Np-hardness and efficient approximation algorithms",
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.",
author = "Alexander Kel'manov",
year = "2017",
language = "English",
volume = "1987",
pages = "291--297",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

RIS

TY - JOUR

T1 - On some euclidean clustering problems

T2 - Np-hardness and efficient approximation algorithms

AU - Kel'manov, Alexander

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85036619108&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85036619108

VL - 1987

SP - 291

EP - 297

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -

ID: 9648000