An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem

Original language	English
Title of host publication	Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	94-96
Number of pages	3
ISBN (Electronic)	9781538615966
DOIs	https://doi.org/10.1109/SIBIRCON.2017.8109845
Publication status	Published - 14 Nov 2017
Event	2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 - Novosibirsk, Russian Federation Duration: 18 Sept 2017 → 22 Sept 2017

Conference	2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Country/Territory	Russian Federation
City	Novosibirsk
Period	18.09.2017 → 22.09.2017

2-approximation polynomial-time algorithm, Euclidean space, NP-hardness, Weighted-clustering

ID: 9115195