|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
A. V. Kel'manov, A. V. Panasenko, V. I. Khandeev, “Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems”, Sib. Zh. Vychisl. Mat., 22:2 (2019), 121–136   ; Num. Anal. Appl., 12:2 (2019), 105–115   |
3
|
| 2. |
A. V. Kel'manov, A. V. Panasenko, V. I. Khandeev, “Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space”, Zh. Vychisl. Mat. Mat. Fiz., 59:5 (2019), 895–904 ; Comput. Math. Math. Phys., 59:5 (2019), 842–850 |
1
|
|
2018 |
| 3. |
A. V. Kel'manov, A. V. Motkova, “Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center”, Zh. Vychisl. Mat. Mat. Fiz., 58:1 (2018), 136–142 ; Comput. Math. Math. Phys., 58:1 (2018), 130–136 |
8
|
|
2017 |
| 4. |
A. V. Kel'manov, A. V. Motkova, V. V. Shenmaier, “Approximation scheme for the problem of weighted 2-partitioning with a fixed center of one cluster”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017), 159–170 ; Proc. Steklov Inst. Math. (Suppl.), 303, suppl. 1 (2018), 136–145 |
1
|
|
2016 |
| 5. |
A. V. Kel'manov, A. V. Motkova, “Exact pseudopolinomial algorithms for a balanced $2$-clustering problem”, Diskretn. Anal. Issled. Oper., 23:3 (2016), 21–34  ; J. Appl. Industr. Math., 10:3 (2016), 349–355 |
14
|
|
| Organisations |
|
| |
|
|
Contact us: