Standard

Algorithms with performance guarantee for a weighted 2-partition problem. / Kel'Manov, Alexander; Motkova, Anna.

In: CEUR Workshop Proceedings, Vol. 1987, 2017, p. 304-309.

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

Harvard

Kel'Manov, A & Motkova, A 2017, 'Algorithms with performance guarantee for a weighted 2-partition problem', CEUR Workshop Proceedings, vol. 1987, pp. 304-309.

APA

Kel'Manov, A., & Motkova, A. (2017). Algorithms with performance guarantee for a weighted 2-partition problem. CEUR Workshop Proceedings, 1987, 304-309.

Vancouver

Kel'Manov A, Motkova A. Algorithms with performance guarantee for a weighted 2-partition problem. CEUR Workshop Proceedings. 2017;1987:304-309.

Author

Kel'Manov, Alexander ; Motkova, Anna. / Algorithms with performance guarantee for a weighted 2-partition problem. In: CEUR Workshop Proceedings. 2017 ; Vol. 1987. pp. 304-309.

BibTeX

@article{0800d427ff5c4a589bc0d7c8e3444e1b,
title = "Algorithms with performance guarantee for a weighted 2-partition problem",
abstract = "We consider the problem of partitioning a finite set of Euclidean points into two clusters minimizing the sum over both clusters the weighted sums of the squared intracluster distances from the elements of the clusters to their centers. The center of one of the clusters is unknown and determined as the average value over all points in the cluster, while the center of the other cluster is the origin. The weight factors for both intracluster sums are the cardinalities of the corresponding clusters. In this work, we present a short survey on the results for this problem and a new result: a 2-approximation algorithm.",
author = "Alexander Kel'Manov and Anna Motkova",
note = "Publisher Copyright: {\textcopyright} Copyright by the paper's authors.",
year = "2017",
language = "English",
volume = "1987",
pages = "304--309",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

RIS

TY - JOUR

T1 - Algorithms with performance guarantee for a weighted 2-partition problem

AU - Kel'Manov, Alexander

AU - Motkova, Anna

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

PY - 2017

Y1 - 2017

N2 - We consider the problem of partitioning a finite set of Euclidean points into two clusters minimizing the sum over both clusters the weighted sums of the squared intracluster distances from the elements of the clusters to their centers. The center of one of the clusters is unknown and determined as the average value over all points in the cluster, while the center of the other cluster is the origin. The weight factors for both intracluster sums are the cardinalities of the corresponding clusters. In this work, we present a short survey on the results for this problem and a new result: a 2-approximation algorithm.

AB - We consider the problem of partitioning a finite set of Euclidean points into two clusters minimizing the sum over both clusters the weighted sums of the squared intracluster distances from the elements of the clusters to their centers. The center of one of the clusters is unknown and determined as the average value over all points in the cluster, while the center of the other cluster is the origin. The weight factors for both intracluster sums are the cardinalities of the corresponding clusters. In this work, we present a short survey on the results for this problem and a new result: a 2-approximation algorithm.

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

M3 - Article

AN - SCOPUS:85036616068

VL - 1987

SP - 304

EP - 309

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -

ID: 9056422