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

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

Source

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)
Compilation, 2017.

Output data

Year: 2017, Pages: 94-96 Pages count : 3 DOI: 10.1109/sibircon.2017.8109845

Authors

Kel'manov Alexander ^1,2 , Motkova Anna ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel'manov A. , Motkova A.
An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem
In compilation 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.94-96. DOI: 10.1109/sibircon.2017.8109845 OpenAlex

OpenAlex:

W2769754130

Пока нет цитирований