1/2-Approximation polynomial-time algorithm for a problem of searching a subset Full article
| Source | 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) Compilation, 2017. |
||||
|---|---|---|---|---|---|
| Output data | Year: 2017, Pages: 8-12 Pages count : 5 DOI: 10.1109/sibircon.2017.8109827 | ||||
| Tags | Approximation algorithm; Computational complexity; Data mining; Machine learning; Minimal sum of squared distances; Optimization problems; Subset with the largest cardinality | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Ageev A.
, Kel'manov A.
, Pyatkin A.
, Khamidullin S.
, Shenmaier V.
1/2-Approximation polynomial-time algorithm for a problem of searching a subset
In compilation 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.8-12. DOI: 10.1109/sibircon.2017.8109827 WOS Scopus OpenAlex
1/2-Approximation polynomial-time algorithm for a problem of searching a subset
In compilation 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.8-12. DOI: 10.1109/sibircon.2017.8109827 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000426816500003 |
| Scopus: | 2-s2.0-85040528319 |
| OpenAlex: | W2769788375 |