Standard

Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence. / Kel'Manov, Alexander; Khandeev, Vladimir.

In: CEUR Workshop Proceedings, Vol. 1987, 2017, p. 298-303.

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

Harvard

Kel'Manov, A & Khandeev, V 2017, 'Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence', CEUR Workshop Proceedings, vol. 1987, pp. 298-303.

APA

Kel'Manov, A., & Khandeev, V. (2017). Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence. CEUR Workshop Proceedings, 1987, 298-303.

Vancouver

Kel'Manov A, Khandeev V. Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence. CEUR Workshop Proceedings. 2017;1987:298-303.

Author

Kel'Manov, Alexander ; Khandeev, Vladimir. / Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence. In: CEUR Workshop Proceedings. 2017 ; Vol. 1987. pp. 298-303.

BibTeX

@article{352b2792eb0448cfb7a2465667e4674f,
title = "Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence",
abstract = "We consider the problems of 2-partitioning a finite set and a finite sequence of points in Euclidean space into clusters (subsets or subsequences) minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on some results for these problems and a new result: a randomized algorithm for the sequence partitioning problem.",
author = "Alexander Kel'Manov and Vladimir Khandeev",
note = "Publisher Copyright: {\textcopyright} Copyright by the paper's authors.",
year = "2017",
language = "English",
volume = "1987",
pages = "298--303",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

RIS

TY - JOUR

T1 - Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence

AU - Kel'Manov, Alexander

AU - Khandeev, Vladimir

N1 - Publisher Copyright: © Copyright by the paper's authors.

PY - 2017

Y1 - 2017

N2 - We consider the problems of 2-partitioning a finite set and a finite sequence of points in Euclidean space into clusters (subsets or subsequences) minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on some results for these problems and a new result: a randomized algorithm for the sequence partitioning problem.

AB - We consider the problems of 2-partitioning a finite set and a finite sequence of points in Euclidean space into clusters (subsets or subsequences) minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on some results for these problems and a new result: a randomized algorithm for the sequence partitioning problem.

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

M3 - Article

AN - SCOPUS:85036654232

VL - 1987

SP - 298

EP - 303

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -

ID: 9056342